Transmitting system and method of processing digital broadcast signal in transmitting system, receiving system and method of receiving digital broadcast signal in receiving system

ABSTRACT

A transmitting system, a receiving system, a method of processing broadcast signals and a method of receiving broadcast signals are disclosed. 
     The method for transmitting a broadcast signal in a transmitter includes encoding mobile data for forward error correction (FEC) to build Reed-Solomon (RS) frames and dividing the built RS frames into RS frame portions, dividing the RS frame portions into Serially Concatenated Convolutional Code (SCCC) blocks and mapping the SCCC blocks to data blocks and scalable data blocks, corresponding to a plurality of data segments, wherein at least one of the SCCC blocks includes one of the data blocks and one of the scalable data blocks, encoding signaling data including a header and a payload, forming data groups including the data blocks and the scalable data blocks, wherein specific data blocks of the data blocks in the data groups include the signaling data having information for a number of ensembles being a collection of services transmitted through the data groups, interleaving data in the data groups, wherein the interleaved data includes a plurality of data segments, and wherein at least one of the plurality of data segments includes a part of one of the data blocks and a part of one of the scalable data blocks and transmitting the interleaved data during slots in a transmission frame.

This application claims the benefit of U.S. Provisional Application No.61/253,042, filed on Oct. 19, 2009, which is hereby incorporated byreference as if fully set forth herein.

BACKGROUND OF THE INVENTION

1. The Field of the Invention

The present invention relates to a digital broadcasting system fortransmitting and receiving a digital broadcast signal, and moreparticularly, to a transmitting system for processing and transmittingthe digital broadcast signal, and a method of processing data in thetransmitting system and the receiving system.

2. Description of the Related Art

The Vestigial Sideband (VSB) transmission mode, which is adopted as thestandard for digital broadcasting in North America and the Republic ofKorea, is a system using a single carrier method. Therefore, thereceiving performance of the digital broadcast receiving system may bedeteriorated in a poor channel environment. Particularly, sinceresistance to changes in channels and noise is more highly required whenusing portable and/or mobile broadcast receivers, the receivingperformance may be even more deteriorated when transmitting mobileservice data by the VSB transmission mode.

SUMMARY OF THE INVENTION

Accordingly, the present invention is directed to a transmitting systemand a method of processing a digital broadcast signal in a transmittingsystem that substantially obviate one or more problems due tolimitations and disadvantages of the related art.

An object of the present invention is to provide a transmission systemwhich is able to transmit additional mobile service data whilesimultaneously maintaining the compatibility with a conventional systemfor transmitting a digital broadcast signal, and a method for processinga broadcast signal.

Another object of the present invention is to signal mapping informationbetween an ensemble and a mobile service using an FIC chunk, to segmentthe FIC chunk into FIC segment units, and to transmit the segmentsthrough an FIC, thereby performing fast service acquisition in areception system.

Another object of the present invention is to transmit a plurality ofFIC segments segmented from an FIC chunk through one subframe or aplurality of subframes so as to prevent the FIC segments from beingwasted if the amount of data of the FIC chunk is less or greater thanthe amount of data of FIC segments transmitted through one subframe.

Another object of the present invention is to transmit protocol versioninformation of an FIC chunk corresponding to an FIC segment through aheader of the FIC segment so as to accurately restore the FIC chunkusing the FIC segments configured by the protocol version in a receptionsystem even when FIC chunks of different protocol versions coexist inone M/H frame.

Another object of the present invention is to transmit identificationinformation identifying whether signaling information transmittedthrough a payload of an FIC segment through a header of the FIC segmentis signaling information of a current M/H frame or signaling informationof a next M/H frame so as to accurately restore an FIC chunk using theFIC segments of the M/H frame in a reception system even when an FICchunk for signaling ensemble configuration information of the currentM/H frame and an FIC chunk for signaling ensemble information of thenext M/H frame coexist in one M/H frame.

Another object of the present invention is to secure robust resilienceto errors encountered when mobile service data is transmitted through achannel, to determine whether or not additional mobile data packets areincluded using signaling information in a receiver, and to securecompatibility if the additional packets are not present.

Another object of the present invention is to receive mobile servicedata without error even when faced with poor channel quality due toghosts and noises, by including an additional mobile data block in adata group.

Additional advantages, objects, and features of the invention will beset forth in part in the description which follows and in part willbecome apparent to those having ordinary skill in the art uponexamination of the following or may be learned from practice of theinvention. The objectives and other advantages of the invention may berealized and attained by the structure particularly pointed out in thewritten description and claims hereof as well as the appended drawings.

To achieve these objects and other advantages and in accordance with thepurpose of the invention, as embodied and broadly described herein, amethod for transmitting a broadcast signal in a transmitter includesencoding mobile data for forward error correction (FEC) to build aReed-Solomon (RS) frame and dividing the built RS frame into RS frameportions, dividing the RS frame portions into Serially ConcatenatedConvolutional Code (SCCC) blocks and mapping the SCCC blocks to datablocks and scalable data blocks, corresponding to a plurality of datasegments, wherein at least one of the SCCC blocks includes one of thedata blocks and one of the scalable data blocks, encoding signaling dataincluding a header and a payload, forming data groups including the datablocks and the scalable data blocks, wherein specific data blocks of thedata blocks in the data groups include the signaling data havinginformation for a number of ensembles being a collection of servicestransmitted through the data groups, interleaving data in the datagroups, wherein the interleaved data includes a plurality of datasegments, and wherein at least one of the plurality of data segmentsincludes a part of one of the data blocks and a part of one of thescalable data blocks and transmitting the interleaved data during slotsin a transmission frame.

In this invention, the payload includes information corresponding to anumber of ensembles transmitted through data groups including thescalable data blocks.

In this invention, the signaling data are divided into a pluralitysignaling data segment payloads.

In this invention, one of the data groups include a segment header forone of the plurality of signaling data segments and the one of theplurality of signaling data segment payloads.

In other example for this invention, the RS frame including a primary RSframe or a secondary RS frame depending on RS frame mode, wherein the RSframe mode indicates whether or not to build the primary RS frame, orbuild the primary RS frame and secondary RS frame.

In another aspect of the present invention, an apparatus fortransmitting a broadcast signal, includes a first encoder configured toencode mobile data for forward error correction (FEC) to build aReed-Solomon (RS) frame and dividing the built RS frame into RS frameportions, a divider configured to divide the RS frame portions intoSerially Concatenated Convolutional Code (SCCC) blocks and mapping theSCCC blocks to data blocks and scalable data blocks, corresponding to aplurality of data segments, wherein at least one of the SCCC blocksincludes one of the data blocks and one of the scalable data blocks, asecond encoder configured to encode signaling data including a headerand a payload, a group formatter configured to form data groupsincluding the data blocks and the scalable data blocks, wherein specificdata blocks of the data blocks in the data groups include the signalingdata having information for a number of ensembles being a collection ofservices transmitted through the data groups, an interleaver configuredto interleave data in the data groups, wherein the interleaved dataincludes a plurality of data segments and wherein at least one of theplurality of data segments includes a part of one of the data blocks anda part of one of the scalable data blocks, a transmission unitconfigured to transmit the interleaved data during slots in atransmission frame.

In this invention, the payload includes information corresponding to anumber of ensembles transmitted through data groups including thescalable data blocks.

In this invention, the signaling data are divided into a plurality ofsignaling data segment payloads.

In this invention, one of the data groups includes a header for one ofthe plurality of signaling data segments and the one of the plurality ofsignaling data segment payloads.

In other example for this invention, the RS frame includes a primary RSframe or a secondary RS frame depending on RS frame mode, wherein the RSframe mode indicates whether or not to build the primary RS frame, orbuild the primary RS frame and secondary RS frame.

And to achieve these objects and other advantages and in accordance withthe purpose of the invention, as embodied and broadly described herein,a method for receiving a broadcast signal in a receiver includesreceiving a broadcast signal including a transmission frame, wherein aparade of data groups in the broadcast signal is received during slotswithin the transmission frame, each data group including data blocks andscalable data blocks, corresponding to a plurality of data segments,wherein at least one of the plurality of data segments includes a partof one of the data blocks and a part of one of the scalable data blocks,wherein specific data blocks of the data blocks in the data groupsinclude the signaling data having information for a number of ensemblesbeing a collection of services transmitted through the each data group,wherein the each data group includes signaling data segments having asegment payload, demodulating the broadcast signal and obtaining thesignaling data segments in the each data group and decoding thesignaling data in the signaling data segments.

In this invention, the signaling data includes a payload includinginformation corresponding to a number of ensembles transmitted throughthe each data group including the scalable data blocks.

In other example of this invention, when the each data group onlyincludes the data blocks, receiver skips the information correspondingto a number of ensembles transmitted through the each data groupincluding the scalable data blocks.

In another aspect of the present invention, an apparatus for receiving abroadcast signal includes a receiver configured to receive a broadcastsignal including a transmission frame, wherein a parade of data groupsin the broadcast signal is received during slots within the transmissionframe, each data group including data blocks and scalable data blocks,corresponding to a plurality of data segments, wherein at least one ofthe plurality of data segments includes a part of one of the data blocksand a part of one of the scalable data blocks, wherein specific datablocks of the data blocks in the data groups include the signaling datahaving information for a number of ensembles being a collection ofservices transmitted through the each data group, wherein the each datagroup includes signaling data segments, each signaling data segmentincluding a segment payload, a demodulator configured to demodulate thebroadcast signal and obtaining the signaling data segments in the eachdata group and a decoder configured to decode the signaling data in thesignaling data segments.

In this invention, the signaling data includes a payload includinginformation corresponding to a number of ensembles transmitted throughthe each data group including the scalable data blocks.

In other example of this invention, when the each data group onlyincludes the data blocks, receiver skips the information correspondingto a number of ensembles transmitted through the each data groupincluding the scalable data blocks.

It is to be understood that both the foregoing general description andthe following detailed description of the present invention areexemplary and explanatory and are intended to provide furtherexplanation of the invention as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are included to provide a furtherunderstanding of the invention and are incorporated in and constitute apart of this application, illustrate embodiment(s) of the invention andtogether with the description serve to explain the principle of theinvention. In the drawings:

FIG. 1 illustrates the relation between an ensemble, an RS frame, aparade, a group division, and a group according to an embodiment of thepresent invention.

FIG. 2 illustrates a data frame (M/H frame) structure fortransmitting/receiving mobile service data according to one embodimentof the present invention.

FIG. 3 illustrates an exemplary structure of a VSB frame, wherein oneVSB frame consists of 2 VSB fields (i.e., an odd field and an evenfield). Herein, each VSB field includes a field synchronization segmentand 312 data segments.

FIG. 4 illustrates a mapping example of the positions to which the first4 slots of a sub-frame are assigned with respect to a VSB frame in aspace region.

FIG. 5 illustrates a mapping example of the positions to which the first4 slots of a sub-frame are assigned with respect to a VSB frame, in atime region.

FIG. 6 illustrates a data group including (118+M) mobile service datapackets according to an embodiment of the present invention.

FIG. 7 illustrates a structure of a data group after being processedwith interleaving according to the embodiment of the present invention,wherein the data group includes (118+M) number of mobile service datapackets.

FIGS. 8 (a) to (d) illustrate various examples of mobile service data ofa first mobile mode and mobile service data of a second mobile modebeing allocated to a group.

FIGS. 9 (a) to (f) illustrate an example of a mobile service data packetbeing allocated to region E within the data group according to anembodiment to the present invention.

FIG. 10 illustrates an example of each group type being segmented basedupon the size of region E according to an embodiment of the presentinvention.

FIGS. 11 (a) and (b) illustrate a data group including (118+M) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 12 illustrates an example of allocating a plurality of parades toone subframe within an M/H frame according to an embodiment of thepresent invention.

FIG. 13 illustrates the relation between a super ensemble, a super RSframe, and two parades according to an embodiment of the presentinvention.

FIG. 14 illustrates an example of allocating parade #1 of group type 4and having an NOG of 5, parade #2 of group type 4 and having an NOG of3, and parade #3 of group type 4 and having an NOG of 8 to a subframeaccording to an embodiment of the present invention.

FIG. 15 illustrates group type 0 of data group, according to anembodiment of the present invention.

FIG. 16 illustrates a structure acquired after a group type 0 of datagroup data group is interleaved, when the data group includes 118 mobileservice data packets, according to an embodiment of the presentinvention.

FIG. 17 illustrates group type 1-0 of data group, according to anembodiment of the present invention.

FIG. 18 illustrates a structure provided after a group type 1-0 of datagroup is interleaved when the data group includes (118+38) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 19 illustrates group type 1-1 of data group, according to anembodiment of the present invention.

FIG. 20 illustrates a structure provided after a group type 1-1 of datagroup is interleaved when the data group includes (118+37) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 21 illustrates group type 1-2 of data group, according to anembodiment of the present invention.

FIG. 22 illustrates a structure provided after a group type 1-2 of datagroup is interleaved when the data group includes (118+36) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 23 illustrates group type 1-4 of data group, according to anembodiment of the present invention.

FIG. 24 illustrates a structure provided after a group type 1-4 of datagroup is interleaved when the data group includes (118+34) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 25 illustrates group type 1-8 of data group, according to anembodiment of the present invention.

FIG. 26 illustrates a structure provided after a group type 1-8 of datagroup is interleaved when the data group includes (118+30) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 27 illustrates group type 2-0 of data group, according to anembodiment of the present invention.

FIG. 28 illustrates a structure provided after a group type 2-0 of datagroup is interleaved, when the data group includes (118+38) mobileservice data packets, according to an embodiment of the presentinvention.

FIG. 29 illustrates group type 2-1 of data group, according to anembodiment of the present invention.

FIG. 30 illustrates a structure provided after a group type 2-1 of datagroup is interleaved when the data group includes (118+37) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 31 illustrates group type 2-2 of data group, according to anembodiment of the present invention.

FIG. 32 illustrates a structure provided after a group type 2-2 of datagroup is interleaved when the data group includes (118+36) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 33 illustrates group type 2-4 of data group, according to anembodiment of the present invention.

FIG. 34 illustrates a structure provided after a group type 2-4 of datagroup is interleaved when the data group includes (118+34) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 35 illustrates group type 2-8 of data group, according to anembodiment of the present invention.

FIG. 36 illustrates a structure provided after a group type 2-9 of datagroup is interleaved when the data group includes (118+30) mobileservice data packets according to an embodiment of the presentinvention.

FIG. 37 illustrates group type 4 of data group, according to anembodiment of the present invention.

FIG. 38 illustrates a structure provided after a group type 4 of datagroup is interleaved, when the data group includes (118+38) mobileservice data packets, according to an embodiment of the presentinvention.

FIG. 39 is a block diagram illustrating a transmission system accordingto an embodiment of the present invention.

FIGS. 40A and 40B illustrate an embodiment of a bitstream syntaxstructure of signaling overlay data sig_overlay_data( ) for overlayparade related signaling information according to the present invention.

FIG. 41 illustrates a syntax structure of a TPC data field for signalingdigital broadcast data according to an embodiment of the presentinvention.

FIG. 42 is a diagram showing a hierarchical signaling structureaccording to an embodiment of the present invention.

FIGS. 43A and 43B illustrate a diagram showing an embodiment of a syntaxstructure of an FIC chunk according to the present invention.

FIG. 44 is a block diagram showing an FIC chunk and FIC segmentsaccording to the present invention.

FIG. 45 is a diagram showing an embodiment of a syntax structure of anFIC segment header according to the present invention.

FIG. 46 is a diagram showing an embodiment of a syntax structure of anFIC chunk header according to the present invention.

FIG. 47 is a diagram showing an embodiment of a syntax structure of anFIC chunk payload according to the present invention.

FIGS. 48A to 48C illustrate a diagram showing another embodiment of asyntax structure of an FIC segment header, an FIC chunk header and anFIC payload.

FIG. 49 is a diagram showing content indicating that the M/H ServiceSignaling tables carried through this M/H Service Signaling Channelshall be differentiated by utilizing table_id and table_id_extensionincluded in the section header of each table.

FIGS. 50A and 50B illustrate a diagram showing an embodiment of aservice map table (SMT) according to the present invention.

FIG. 51 is a diagram showing another embodiment of a service map table(SMT) according to the present invention.

FIGS. 52A and 52B illustrate a diagram showing an embodiment of a cellinformation table (CIT) according to the present invention.

FIG. 53 is a diagram showing another embodiment of a cell informationtable (CIT) according to the present invention.

FIG. 54 is a diagram showing an embodiment of a service label table(SLT) according to the present invention.

FIG. 55 is a block diagram showing an embodiment of a digital broadcastreceiver according to the present invention.

FIG. 56 is a flowchart illustrating an embodiment of a transmissionsystem of the present invention.

FIG. 57 is a flowchart illustrating an embodiment of a reception systemof the present invention.

FIG. 58 is a block diagram illustrating a receiving system according toan embodiment of the present invention.

FIG. 59 illustrates an example of a demodulating unit in a digitalbroadcast receiving system according to the present invention.

FIG. 60 illustrates a block view showing the structure of a receivingsystem according to an embodiment of the present invention.

FIG. 61 illustrates a detailed block view of a demodulator included inthe channel synchronizer 5301 according to an embodiment of the presentinvention.

FIGS. 62 (a) and (b) illustrate a known data symbol sequence and apartial correlation unit according to an embodiment of the presentinvention.

FIG. 63 is a conceptual diagram illustrating a method for roughlyestimating an initial frequency offset by dividing a second known datasequence into 8 parts and calculating partial correlation of the 8 partsaccording to an embodiment of the present invention.

FIG. 64 is a conceptual diagram illustrating a method for preciselyestimating a frequency offset using a maximum-likelihood algorithmaccording to an embodiment of the present invention.

FIG. 65 illustrates an example of linear interpolation.

FIG. 66 illustrates an example of linear extrapolation.

FIG. 67 illustrates an example of a channel equalizer according to anembodiment of the present invention.

FIG. 68 illustrates a serial concatenated convolution code (SCCC) codingprocess according to an embodiment of the present invention.

FIG. 69 illustrates a detailed block view showing a block decoderaccording to an embodiment of the present invention.

FIG. 70 is a block diagram illustrating a pattern generator of a symbolinterleaver according to an embodiment of the present invention.

FIG. 71 illustrates an example of a symbol interleaving pattern when anoffset value is set to ‘0’ according to an embodiment of the presentinvention.

FIGS. 72 (a) and (b) illustrate a conceptual diagram illustrating aprocess for performing the symbol interleaving using only a symbolinterleaving pattern P(i) according to an embodiment of the presentinvention.

FIG. 73 illustrates a structure of a Reed Solomon (RS) frame decoderaccording to an embodiment of the present invention.

FIGS. 74 (a) to (b′) illustrate that when an RS frame mode value isequal to ‘00’, an exemplary process of grouping several portions beingtransmitted to a parade, thereby forming an RS frame and an RS framereliability map.

FIGS. 75 (a) to (d′) illustrate an example of an error correctiondecoding process according to an embodiment of the present invention.

FIGS. 76 (a) to (f) illustrate an example of an error correctiondecoding process according to an embodiment of the present invention.

FIG. 77 illustrates a block view of the signaling decoder according toan embodiment of the present invention.

FIG. 78 is a detailed block diagram illustrating an iterative turbodecoder according to an embodiment of the present invention.

FIG. 79( a) illustrates an exemplary case in which a trellis encoder isserially concatenated with an even component encoder, and FIG. 79( b)illustrates an exemplary case in which a trellis encoder is seriallyconcatenated with an odd component encoder.

FIG. 80 is a trellis diagram including states capable of being acquiredwhen a start state for an even decoder is set to ‘00000’.

FIG. 81 is a trellis diagram including states capable of being acquiredwhen a start state for an odd decoder is set to ‘00000’.

FIGS. 82 (a) to (h) illustrate a detailed embodiment of a process ofextracting a TNoG according to an embodiment of the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

Reference will now be made in detail to the preferred embodiments of thepresent invention, examples of which are illustrated in the accompanyingdrawings. Wherever possible, the same reference numbers will be usedthroughout the drawings to refer to the same or like parts.

In addition, although the terms used in the present invention areselected from generally known and used terms, some of the termsmentioned in the description of the present invention have been selectedby the applicant at his or her discretion, the detailed meanings ofwhich are described in relevant parts of the description herein.Furthermore, it is required that the present invention is understood,not simply by the actual terms used but by the meaning of each termlying within.

For convenience of description and better understanding of the presentinvention, abbreviations and terms to be use in the present inventionare defined as follows.

Among the terms used in the description of the present invention, mainservice data correspond to data that can be received by a fixedreceiving system and may include audio/video (A/V) data. Morespecifically, the main service data may include A/V data of highdefinition (HD) or standard definition (SD) levels and may also includediverse data types required for data broadcasting. Also, the known datacorrespond to data pre-known in accordance with a pre-arranged agreementbetween the receiving system and the transmitting system.

Additionally, among the terms used in the present invention, “M/H (orMH)” corresponds to the initials of “mobile” and “handheld” andrepresents the opposite concept of a fixed-type system. Furthermore, theM/H service data may include at least one of mobile service data andhandheld service data, and will also be referred to as “mobile servicedata” for simplicity. Herein, the mobile service data not onlycorrespond to M/H service data but may also include any type of servicedata with mobile or portable characteristics. Therefore, the mobileservice data according to the present invention are not limited only tothe M/H service data.

The above-described mobile service data may correspond to data havinginformation, such as program execution files, stock information, and soon, and may also correspond to A/V data. Most particularly, the mobileservice data may correspond to A/V data having lower resolution andlower data rate as compared to the main service data. For example, if anA/V codec that is used for a conventional main service corresponds to aMPEG-2 codec, a MPEG-4 advanced video coding (AVC) or scalable videocoding (SVC) having better image compression efficiency may be used asthe A/V codec for the mobile service. Furthermore, any type of data maybe transmitted as the mobile service data. For example, transportprotocol expert group (TPEG) data for broadcasting real-timetransportation information may be transmitted as the main service data.

Also, a data service using the mobile service data may include weatherforecast services, traffic information services, stock informationservices, viewer participation quiz programs, real-time polls andsurveys, interactive education broadcast programs, gaming services,services providing information on synopsis, character, background music,and filming sites of soap operas or series, services providinginformation on past match scores and player profiles and achievements,and services providing information on product information and programsclassified by service, medium, time, and theme enabling purchase ordersto be processed. Herein, the present invention is not limited only tothe services mentioned above.

Additionally, in the embodiment of the present invention, a group (alsoreferred to as an M/H group or a data group) corresponds to a collection(or group) of data packets confined within a slot (also referred to asan M/H slot).

A group division refers to a set of group regions within a slot. Herein,a group division is categorized into a Primary Group Division or aSecondary Group Division. At this point, a collection of primary groupdivisions within an M/H frame configures (or forms) a primary parade,whereas a collection of secondary group divisions configures (or forms)a secondary parade or an overlay parade.

A group type is determined by the configuration of a group divisionwithin a single group.

A parade (also referred to as an M/H parade) refers to a collection ofgroups that have the same FEC parameters. More specifically, a paraderefers to a collection of group divisions of groups having the samegroup type.

A primary parade (also referred to as a primary M/H parade) correspondsto a collection of primary group divisions, and a secondary parade (alsoreferred to as a secondary M/H parade) corresponds to a collection ofsecondary group divisions. Each of the secondary group divisions iscarried (or transported) through the same slot with its respectivelypaired primary group division. The secondary parade has the same paradeidentifier (ID) as its respective primary parade (i.e., the secondaryparade shares the same parade ID with its respective primary parade)

An overlay parade (also referred to as an overlay M/H parade)corresponds to a collection of secondary group divisions. And, in thiscase, the secondary group divisions are not paired with any of theprimary group divisions.

An RS frame corresponds to a two (2)-dimensional (2D) data frame,wherein an RS frame payload is RS-CRC encoded.

In a primary RS frame, a primary RS frame parade is RS-CRC encoded. Theprimary RS frame is transmitted (or carried) through a primary parade.

In a secondary RS frame, a secondary RS frame parade is RS-CRC encoded.The secondary RS frame is transmitted (or carried) through a secondaryparade.

In an overlay RS frame, an overlay RS frame payload is RS-CRC encoded.The overlay RS frame is transmitted (or carried) through an overlayparade.

A super RS frame corresponds to an RS frame wherein a super RS framepayload is RS-CRC encoded. The super RS frame is transported (orcarried) through two arbitrary parades.

An ensemble (also referred to as an M/H ensemble) refers to a collectionof RS frames having the same FEC codes. Herein, each RS frameencapsulates a collection of streams.

A primary ensemble corresponds to a collection of consecutive primary RSframes.

A secondary ensemble corresponds to a collection of consecutivesecondary RS frames.

An overlay ensemble corresponds to a collection of consecutive overlayRS frames.

A super ensemble (also referred to as a super M/H ensemble) correspondsto a collection of consecutive super RS frames.

In the embodiment of the present invention, data for mobile services maybe transmitted by using a portion of the channel capacity that was usedto transmit data for main services. Alternatively, data for mobileservice may also be transmitted by using the entire channel capacitythat was used to transmit data for main services. The data for mobileservices correspond to data required for mobile services. Accordingly,the data for mobile services may include actual mobile service data aswell as known data, signaling data, RS parity data for error-correctingmobile service data, and so on. In the description of the embodiment ofthe present invention, the data for mobile services will be referred toas mobile service data or mobile data for simplicity.

The mobile service data may be categorized as mobile service data of afirst mobile mode or Core Mobile Mode (CMM) and mobile service data of asecond mobile mode or Extended Mobile Mode (EMM) or Scalable FullChannel Mobile Mode (SFCMM).

Furthermore, when the second mobile mode is used along with the firstmobile mode, the above-described two modes may be collectively definedas the Scalable Full Channel Mobile Mode (SFCMM).

The first mobile mode is a mode in which Mobile DTV services aretransmitted while reserving at least 38 of the 156 packets in each M/HSlot for legacy A/53-compatible services. The second mobile mode is amode in which Mobile DTV services are transmitted while reserving fewerthan 38 of the 156 packets in some or all M/H Slots for legacyA/53-compatible services.

According to the definition of CMM, SFCMM, Ensemble and Parade, the CMMensemble is a Primary or Secondary Ensemble that is compatible with theCMM system. A CMM Ensemble carries a collection of CMM Services and theSFCMM ensemble is a Primary or Secondary Ensemble that carries acollection of SFCMM Services and is backwards compatible with, but notrecognizable by, a CMM receiver/decoder.

And also, the CMM Parade is an M/H Parade that is compatible with theCMM system. A CMM Parade consists of DATA Groups, where each DATA Groupdoes not include the Group Region E and carries an entire RS Framebelonging to the corresponding CMM Ensemble.

The SFCMM Parade is an M/H Parade that is backwards compatible with, butnot recognizable by, a CMM system receiver/decoder. An SFCMM Paradeconsists of DATA Groups, where each DATA Group contains the Group RegionE and carries an entire RS Frame belonging to the corresponding SFCMMEnsemble.

The CMM Service is an M/H Service that is compatible with the CMMsystem. A CMM Service is delivered through a CMM Ensemble. And the CMMService is an M/H Service that is compatible with the CMM system. A CMMService is delivered through a CMM Ensemble.

Also, according to an embodiment of the present invention, a group (alsoreferred to as an M/H group or a data group) corresponds to a collectionof M/H Encapsulated (MHE) data packets confined within a slot (alsoreferred to as an M/H slot).

A group division corresponds to a collection (or set) of group regions(also referred to as M/H group regions) within a slot. Herein, a groupdivision is categorized into a Primary Group Division or a SecondaryGroup Division.

A group region corresponds to a collection (or set) of DATA blocks orextended DATA blocks.

A group type is determined by the configuration of a group divisionwithin a single group.

Known data—Known data is pre-recognized by an agreement between atransmission system and a reception system, and may be used for channelequalization, etc.

FEC—FEC is an abbreviation of a Forward Error Correction, and is ageneric name of technologies wherein a reception end can spontaneouslycorrect an error of a digital signal transmitted from the transmissionend to the reception end without retransmission of a correspondingsignal by the transmission end.

TPC—TPC is an abbreviation of a Transmission Parameter Channel. TPC iscontained in each data group, and then transmitted. The TPC providesinformation about a data frame and a data group to the reception end,and performs signaling of the provided information.

TS—TS is an abbreviation of a Transport Stream.

RS—RS is an abbreviation of Reed-Solomon.

CRC—CRC is an abbreviation of a Cyclic Redundancy Check.

SCCC—SCCC is an abbreviation of a Serial Concatenated ConvolutionalCode.

PCCC—PCCC is an abbreviation of a Parallel Concatenated ConvolutionalCode.

FIC—FIC is an abbreviation of a Fast information channel. FIC carriescross-layer information. This information primarily includes channelbinding information between ensembles and services.

M/H Ensemble (or simply “Ensemble”)—A collection of consecutive RSFrames with the same FEC codes, where each RS Frame encapsulates acollection of IP streams.

CMM Ensemble—A Primary or Secondary Ensemble that is compatible with theCMM system. A CMM Ensemble carries a collection of CMM Services.

SFCMM Ensemble—A Primary or Secondary Ensemble that carries a collectionof SFCMM Services and is backwards compatible with, but not recognizableby, a CMM receiver/decoder.

M/H Service—A package of packetized streams transmitted via an M/HBroadcast, which package is composed of a sequence of events which canbe broadcast as part of a schedule.

CMM Service—An M/H Service that is compatible with the CMM system. A CMMService is delivered through a CMM Ensemble.

SFCMM Service—An M/H Service that is delivered through an SFCMM Ensembleand therefore is not recognizable by a CMM receiver/decoder.

M/H Service Signaling Channel—A single stream incorporated within eachM/H Ensemble. The current version of the M/H SSC uses a IP multicaststream to deliver M/H Service Signaling tables that include IP-level M/HService access information.

Embodiments of the present invention will hereinafter be described withreference to the annexed drawings.

FIG. 1 illustrates the relation between an ensemble, an RS frame, aparade, a group division, and a group according to an embodiment of thepresent invention.

Referring to FIG. 1, a primary ensemble and a primary RS frame and aprimary parade are mapped to a one-to-one-to-one (1:1:1) ratio. Asecondary ensemble and a secondary RS frame and a secondary parade aremapped to a one-to-one-to-one (1:1:1) ratio. Also, an overlay ensembleand an overlay RS frame and an overlay parade are mapped to aone-to-one-to-one (1:1:1) ratio. However, a super ensemble and a superRS frame and a super parade are mapped to a one-to-one-to-two (1:1:2)ratio.

According to the embodiment of the present invention, a primary RS framepayload is RS-CRC encoded so as to configure (or form) a primary RSframe. Herein, the primary RS frame is carrier (or transported) throughthe primary parade. At this point, the primary parade is allocated andtransmitted to a plurality of groups. Most particularly, the primaryparade is allocated and transmitted to a primary group division of eachgroup.

Also, a secondary RS frame payload is RS-CRC encoded so as to configure(or form) a secondary RS frame. Herein, the secondary RS frame iscarrier (or transported) through the secondary parade. At this point,the secondary parade is allocated and transmitted to a secondary groupdivision of each group.

Furthermore, an overlay RS frame payload is RS-CRC encoded so as toconfigure (or form) an overlay RS frame. Herein, the overlay RS frame iscarrier (or transported) through the overlay parade. At this point, theoverlay parade is allocated and transmitted to a secondary groupdivision of each group.

More specifically, one group is divided into a primary group divisionand a secondary group division. At this point, data of a primary paradeare allocated to the primary group division. Conversely, data of asecondary parade or data of an overlay parade are allocated to thesecondary group division. In other words, one group may transmit data ofa primary parade and data of a secondary parade, and the group may alsotransmit data of a primary parade and data of an overlay parade.

According to another embodiment of the present invention, regions A, B,C, D, and E belonging to a data group may all (or entirely) belong to aprimary group division. And, according to yet another embodiment of thepresent invention, regions A and B within a data group may belong to theprimary group division, and regions C, D, and E may belong to thesecondary group division.

FIG. 2 illustrates a data frame (M/H frame) structure fortransmitting/receiving mobile service data according to one embodimentof the present invention.

In the embodiment of the present invention, the mobile service data arefirst multiplexed with main service data in data frame units and, then,modulated in a VSB mode and transmitted to the receiving system.

The term “data frame” mentioned in the embodiment of the presentinvention may be defined as the concept of a time during which mainservice data and mobile service data are transmitted. For example, onedata frame may be defined as a time consumed for transmitting 20 VSBdata frames.

At this point, one data frame consists of K1 number of sub-frames,wherein one sub-frame includes K2 number of slots. Also, each slot maybe configured of K3 number of data packets. In the embodiment of thepresent invention, K1 will be set to 5, K2 will be set to 16, and K3will be set to 156 (i.e., K1=5, K2=16, and K3=156). The values for K1,K2, and K3 presented in this embodiment either correspond to valuesaccording to a preferred embodiment or are merely exemplary. Therefore,the above-mentioned values will not limit the scope of the presentinvention.

In the example shown in FIG. 2, one data frame consists of 5 sub-frames,wherein each sub-frame includes 16 slots. In this case, the data frameaccording to the present invention includes 5 sub-frames and 80 slots.

Also, in a packet level, one slot is configured of 156 data packets(i.e., transport stream packets), and in a symbol level, one slot isconfigured of 156 data segments. Herein, the size of one slotcorresponds to one half (½) of a VSB field. More specifically, since one207-byte data packet has the same amount of payload data as payload dataof a segment, a data packet prior to being interleaved may also be usedas a data segment.

156 data packets contained in a slot may be composed of 156 main servicedata packets, may be composed of 118 mobile service data packets and 38main service data packets, or may be composed of (118+M) mobile servicedata packets and L main service data packets. In this case, the sum of Mand L may be set to 38 according to one embodiment of the presentinvention. In addition, M may be zero ‘0’ or a natural number of 38 orless.

One data group is transmitted during a single slot. In this case, thetransmitted data group may include 118 mobile service data packets or(118+M) mobile service data packets.

That is, a data group may be defined as a set of data units includingmobile service data present in one slot. In this case, the mobileservice data may be defined as pure mobile service data, or may bedefined as the concept that includes data for transmitting mobileservice data, such as signaling data, known data, etc.

FIG. 3 illustrates an exemplary structure of a VSB frame, wherein oneVSB frame consists of 2 VSB fields (i.e., an odd field and an evenfield). Herein, each VSB field includes a field synchronization segmentand 312 data segments.

The slot corresponds to a basic time period for multiplexing the mobileservice data and the main service data. Herein, one slot may eitherinclude the mobile service data or be configured only of the mainservice data.

If one M/H frame is transmitted during one slot, the first 118 datapackets within the slot correspond to a data group. And, the remaining38 data packets become the main service data packets. In anotherexample, when no data group exists in a slot, the corresponding slot isconfigured of 156 main service data packets.

Meanwhile, when the slots are assigned to a VSB frame, an offset existsfor each assigned position.

FIG. 4 illustrates an exemplary structure of a VSB frame, wherein oneVSB frame consists of 2 VSB fields (i.e., an odd field and an evenfield). Herein, each VSB field includes a field synchronization segmentand 312 data segments.

The slot corresponds to a basic time period for multiplexing the mobileservice data and the main service data. Herein, one slot may eitherinclude the mobile service data or be configured only of the mainservice data.

If one M/H frame is transmitted during one slot, the first 118 datapackets within the slot correspond to a data group. And, the remaining38 data packets become the main service data packets. In anotherexample, when no data group exists in a slot, the corresponding slot isconfigured of 156 main service data packets.

Meanwhile, when the slots are assigned to a VSB frame, an offset existsfor each assigned position.

FIG. 4 illustrates a mapping example of the positions to which the first4 slots of a sub-frame are assigned with respect to a VSB frame in aspace region. And, FIG. 5 illustrates a mapping example of the positionsto which the first 4 slots of a sub-frame are assigned with respect to aVSB frame in a time region.

Referring to FIG. 4 and FIG. 5, a 38th data packet (TS packet #37) of a1st slot (Slot #0) is mapped to the 1st data packet of an odd VSB field.A 38th data packet (TS packet #37) of a 2nd slot (Slot #1) is mapped tothe 157th data packet of an odd VSB field. Also, a 38th data packet (TSpacket #37) of a 3rd slot (Slot #2) is mapped to the 1st data packet ofan even VSB field. And, a 38th data packet (TS packet #37) of a 4th slot(Slot #3) is mapped to the 157th data packet of an even VSB field.Similarly, the remaining 12 slots within the corresponding sub-frame aremapped in the subsequent VSB frames using the same method.

Meanwhile, one data group may be divided into at least one or morehierarchical regions. And, depending upon the characteristics of eachhierarchical region, the type of mobile service data being inserted ineach region may vary. For example, the data group within each region maybe divided (or categorized) based upon the receiving performance.

According to the embodiment of the present invention, a data group priorto being processed with data interleaving is divided into regions A, B,C, and D. At this point, the data group may further include region E.Herein, the size of region E is variable, and each group may include anumber of data packets equal to or less than 38. More specifically,according to the embodiment of the present invention, region E mayinclude a maximum of 38 data packets within a single group.

FIG. 6 illustrates a data group including (118+M) mobile service datapackets according to an embodiment of the present invention.

Referring to FIG. 6, the data group includes A, C, D and E regions. Thedata group is contained in a slot including 156 packets. That is, apredetermined number of packets contained in one slot form the datagroup, and such packets include mobile service data.

After 118 mobile service data packets fixed in the data group areinterleaved, the data group is divided into A, B, C and D regions.

Meanwhile, a variable number (M) of mobile service data packets capableof being contained in the data group are contained in an additionalregion E. In the case where the data group in one slot is composed of118 mobile service data packets, the E region can be defined as aspecific region acquired when mobile service data packets are added tothe region composed of only main service data packets. In other words,the E region may include a scalable number of mobile service datapackets in one slot.

The mapping format of the mobile service data packets in the E regionmay be changed according to the intention of a designer. In other words,according to one embodiment of the present invention, when the number ofmobile service data packets is 38 or less (i.e., M<38) as shown in FIG.6, a specific packet region in one slot remains empty in such a mannerthat the empty specific packet region can be used as a main service datapacket region, and therefore mobile service data packets can be mappedto the remaining parts. According to another embodiment of the presentinvention, mobile service data packets can be mapped to the data groupin such a manner that M scalable mobile service data packets containedin the E region are spaced apart from one another at intervals of apredetermined distance.

Also, the mobile service data being allocated to one group may bebroadly divided into two types of mobile modes.

Herein, one of the mobile modes is referred to as a first mobile mode ora Core Mobile Mode (CMM), and the other mobile mode is referred to as asecond mobile mode or an Extended Mobile Mode (EMM) or a Scalable FullChannel Mobile Mode (SFCMM). Furthermore, the first mobile mode and thesecond mobile mode may be collectively referred to as the Scalable FullChannel Mobile Mode. (SFCMM). At this point, the mobile service data ofthe first mobile mode and the mobile service data of the second mobilemode may be encoded at a coding rate of ½, ⅓, or ¼.

The first mobile mode corresponds to a mode that is compatible with theconventional mobile broadcasting system. And, the second mobile mode maybe either compatible or non-compatible with the conventional mobileservice data. However, the second mobile mode corresponds to a mode thattransmits data that cannot be recognized (or acknowledged) by theconventional mobile broadcasting system.

Only mobile service data of the first mobile mode may be allocated toone group, or only mobile service data of the second mobile mode may beallocated to the one group. Alternatively, both the mobile service dataof the first mobile mode and the mobile service data of the secondmobile mode may both be allocated to one group.

FIG. 7 illustrates a structure of a data group after being processedwith interleaving according to the embodiment of the present invention,wherein the data group includes (118+M) number of mobile service datapackets.

A data group structure shown in FIG. 7 is transmitted to the receivingsystem. More specifically, one data packet is data-interleaved anddispersed (or distributed) to a plurality of segments, thereby beingtransmitted to the receiving system. FIG. 7 shows an example of a singlegroup distributed to 208 data segments. At this point, since one datapacket of 207 bytes has the same data size of one data segment, a packetprior to being data-interleaved may be used as the concept of a packet.

FIG. 8 illustrates various examples of mobile service data of the firstmobile mode and mobile service data of the second mobile mode beingallocated to a group.

According to the embodiment of the present invention, as shown in FIG.8, the mobile service data of the first mobile mode and the mobileservice data of the second mobile mode are allocated as shown in (a) to(d) of FIG. 8.

of FIG. 8 shows an example wherein the mobile service data of the firstmobile mode are allocated to regions A, B, C, and D within the datagroup, and wherein the mobile service data of the second mobile mode arenot allocated. In this case, region E does not exist in the group, andmain service data are allocated (or assigned) to the respective region.According to the embodiment of the present invention, this exemplarycase will be referred to as group type 0. More specifically, when it isassumed that the number of mobile service data packets forming one datagroup corresponds to (118+M), then in case (a) of FIG. 8, the value of Mis equal to 0.

of FIG. 8 shows an example wherein the mobile service data of the firstmobile mode are allocated (or assigned) to regions A, B, C, and D withinthe data group, and wherein the mobile service data of the second mobilemode are allocated to region E. According to the embodiment of thepresent invention, this exemplary case will be referred to as group type1. More specifically, the mobile service data being transmitted throughregions A, B, C, and D within the data group may be validly used in theconventional mobile broadcasting system.

of FIG. 8 shows an example wherein the mobile service data of the firstmobile mode are allocated (or assigned) to regions A and B, within thedata group, and wherein the mobile service data of the second mobilemode are allocated to regions C, D, and E. According to the embodimentof the present invention, this exemplary case will be referred to asgroup type 2. More specifically, the mobile service data beingtransmitted through regions A and B within the data group may bereceived and validly decoded by the conventional mobile broadcastingsystem. However, the mobile service data being transmitted throughregions C, D, and E within the data group are not processed as validinformation by the conventional mobile broadcasting system.

of FIG. 8 shows an example wherein the mobile service data of the secondmobile mode are allocated to regions A, B, C, D, and E within the datagroup, and wherein the mobile service data of the first mobile mode arenot allocated. According to the embodiment of the present invention,this exemplary case will be referred to as group type 3. Herein, themobile service data being transmitted through regions A, B, C, D, and Ewithin the data group are not processed as valid information by theconventional mobile broadcasting system.

As described above, the group type is decided depending upon how the 156data packets being included in one data group are used. In other words,the group type is decided depending upon which one of regions A, B, C,and D will be used for the mobile service data of the second mobilemode.

Meanwhile, one data group may include a maximum of 156 data packets.Herein, among the 156 data packets, 118 data packets are assigned toregions A, B, C, and D, and a portion of the remaining 38 data packetsor all of the remaining 38 data packets are assigned to region E. Atthis point, none of the data packets may be assigned to region E. Inthis case, as shown in (a) of FIG. 8, region E does not exist in thecorresponding data group. In the data group that does not include aregion E, mobile service data of the first mobile mode are assigned (orallocated) to the 118 data packets included in region A, B, C, and D,and main service data are assigned to the remaining 38 data packets.More specifically, in the data group that does not include region E,mobile service data of the second mobile mode are not assigned.

This indicates that only the mobile service data of the second mobilemode are assigned to region E within the data group, as shown in (b) to(d) of FIG. 8. More specifically, the mobile service data of the firstmobile mode Furthermore, in a data group including region E, the mobileservice data of the second mobile mode may be further assigned to atleast one of regions A, B, C, and D.

If the mobile service data of the second mobile mode are assigned to allof the regions A, B, C, D, and E, as shown in (d) of FIG. 8, mobileservice data of the first mobile mode cannot be assigned to thecorresponding data group. With the exception for the case wherein themobile service data of the second mobile mode are assigned to all of theregions A, B, C, D, and E, as shown in (d) of FIG. 8, the mobile servicedata of the first mobile mode are assigned to at least one of regions A,B, C, and D.

Also, even when region E does not exist is a specific data group, thenumber of data packets included in region E may vary. More specifically,region E may include a number of data packets ranging from a minimum of0 data packet to a maximum of 38 data packets.

FIG. 9 illustrates an example of a mobile service data packet beingallocated to region E within the data group according to an embodimentto the present invention.

of FIG. 9 shows an example of region E not being assigned (orallocated). Herein, main service data are assigned to the 38 datapackets within the corresponding data group. More specifically, datapackets that are used for mobile services of the second mobile mode donot exist. In this case, according to the embodiment of the presentinvention, regions, A, B, C, and D of the corresponding group are alsonot used for the mobile services of the second mobile mode.

of FIG. 9 shows an example of 38 data packets being assigned to regionE. In this case, main service data are not assigned to the correspondinggroup. More specifically, the 38 data packets that are included inregion E may be used for mobile services of the second mobile mode.

of FIG. 9 shows an example of 37 data packets being assigned to regionE. In this case, main service data are assigned to one data packetwithin the corresponding data group. According to the embodiment of thepresent invention, among the 38 data packets, the slowest data packet(i.e., the data packet chronologically placed in the last position) isexcluded from region E, and the one data packet that is excluded fromregion E is used for the main service. More specifically, the 37 datapackets included in region E may be used for the mobile services of thesecond mobile mode.

of FIG. 9 shows an example of 36 data packets being assigned to regionE. In this case, main service data are assigned to two data packetswithin the corresponding data group. According to the embodiment of thepresent invention, among the 38 data packets, the fastest data packet(i.e., the data packet chronologically placed in the first position) andthe slowest data packet (i.e., the data packet chronologically placed inthe last position) are excluded from region E, and the two data packetsthat are excluded from region E are used for the main services. Morespecifically, the 36 data packets included in region E may be used forthe mobile services of the second mobile mode.

of FIG. 9 shows an example of 34 data packets being assigned to regionE. In this case, main service data are assigned to four (4) data packetswithin the corresponding data group. According to the embodiment of thepresent invention, among the 38 data packets, the two fastest datapackets (i.e., the two data packets chronologically placed in the firsttwo positions) and the two slowest data packets (i.e., the two datapackets chronologically placed in the last two positions) are excludedfrom region E, and the four data packets that are excluded from region Eare used for the main services. More specifically, the 34 data packetsincluded in region E may be used for the mobile services of the secondmobile mode.

of FIG. 9 shows an example of 30 data packets being assigned to regionE. In this case, main service data are assigned to eight (8) datapackets within the corresponding data group. According to the embodimentof the present invention, among the 38 data packets, the four fastestdata packets (i.e., the four data packets chronologically placed in thefirst four positions) and the four slowest data packets (i.e., the fourdata packets chronologically placed in the last four positions) areexcluded from region E, and the eight data packets that are excludedfrom region E are used for the main services. More specifically, the 30data packets included in region E may be used for the mobile services ofthe second mobile mode.

More specifically, among the remaining 38 data packets excluding the 118data packets within the data group, region E includes the data packetsthat are used for the mobile service of the second mobile mode.

According to the embodiment of the present invention, each group type isfurther segmented based upon the size of region E.

Meanwhile, a variable number (M) of mobile service data packets capableof being contained in the data group are contained in an additionalregion E. In the case where the data group in one slot is composed of118 mobile service data packets, the E region can be defined as aspecific region acquired when mobile service data packets are added tothe region composed of only main service data packets. In other words,the E region may include a scalable number of mobile service datapackets in one slot.

The mapping format of the mobile service data packets in the E regionmay be changed according to the intention of a designer. In other words,according to one embodiment of the present invention, when the number ofmobile service data packets is 38 or less (i.e., M<38), a specificpacket region in one slot remains empty in such a manner that the emptyspecific packet region can be used as a main service data packet region,and therefore mobile service data packets can be mapped to the remainingparts. According to another embodiment of the present invention, mobileservice data packets can be mapped to the data group in such a mannerthat M scalable mobile service data packets contained in the E regionare spaced apart from one another at intervals of a predetermineddistance.

FIG. 10 illustrates an example of each group type being segmented basedupon the size of region E according to an embodiment of the presentinvention.

At this point, group type 0 corresponds to when region E does not exist,and, in this case, further segmentation is not performed. In the datagroup of group type 0, a primary group division includes regions A, B,C, and D or includes regions A and B. Also, either a secondary groupdivision does not exist, or a secondary group division includes regionsC and D.

Depending upon the size of region E, group type 1 may be furthersegmented to 5 group types (i.e., group types 1-0, 1-1, 1-2, 1-4, and1-8). In the data group of group type 1, a primary group divisionincludes regions A, B, C, and D, and a secondary group division includesregion E.

At this point, group type 1-0 (G1-0) corresponds to a group typeconfigured by combining (b) of FIG. 8 and (b) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to region E, and region E includes 38 data packets.Group type 1-1 (G1-1) corresponds to a group type configured bycombining (b) of FIG. 8 and (c) of FIG. 9. Herein, the mobile servicedata of the second mobile mode are assigned (or allocated) only toregion E, and region E includes 37 data packets. Group type 1-2 (G1-2)corresponds to a group type configured by combining (b) of FIG. 8 and(d) of FIG. 9. Herein, the mobile service data of the second mobile modeare assigned (or allocated) only to region E, and region E includes 36data packets. Group type 1-4 (G1-4) corresponds to a group typeconfigured by combining (b) of FIG. 8 and (e) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to region E, and region E includes 34 data packets. And,group type 1-8 (G1-8) corresponds to a group type configured bycombining (b) of FIG. 8 and (f) of FIG. 9. Herein, the mobile servicedata of the second mobile mode are assigned (or allocated) only toregion E, and region E includes 30 data packets.

Depending upon the size of region E, group type 2 may be furthersegmented to 5 group types (i.e., group types 2-0, 2-1, 2-2, 2-4, and2-8). In the data group of group type 2, a primary group divisionincludes regions A and B, and a secondary group division includesregions C, D, and E.

At this point, group type 2-0 (G2-0) corresponds to a group typeconfigured by combining (c) of FIG. 8 and (b) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to regions C, D, and E. Herein, region E includes 38data packets. Group type 2-1 (G2-1) corresponds to a group typeconfigured by combining (c) of FIG. 8 and (c) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to regions C, D, and E. Herein, region E includes 37data packets. Group type 2-2 (G2-2) corresponds to a group typeconfigured by combining (c) of FIG. 8 and (d) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to regions C, D, and E. Herein, region E includes 36data packets. Group type 2-4 (G2-4) corresponds to a group typeconfigured by combining (c) of FIG. 8 and (e) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to regions C, D, and E. Herein, region E includes 34data packets. And, group type 2-8 (G2-8) corresponds to a group typeconfigured by combining (c) of FIG. 8 and (f) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to regions C, D, and E. Herein, region E includes 30data packets.

Depending upon the size of region E, group type 3 may be furthersegmented to 5 group types (i.e., group types 3-0, 3-1, 3-2, 3-4, and3-8). In the data group of group type 3, a primary group divisionincludes regions A, B, C, D, and E, and a secondary group division doesnot exist.

At this point, group type 3-0 (G3-0) corresponds to a group typeconfigured by combining (d) of FIG. 8 and (b) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to regions A, B, C, D, and E. Herein, region E includes38 data packets. Group type 3-1 (G3-1) corresponds to a group typeconfigured by combining (d) of FIG. 8 and (c) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to regions A, B, C, D, and E. Herein, region E isconfigured of 37 data packets. Group type 3-2 (G3-2) corresponds to agroup type configured by combining (d) of FIG. 8 and (d) of FIG. 9.Herein, the mobile service data of the second mobile mode are assigned(or allocated) only to regions A, B, C, D, and E. Herein, region Eincludes 36 data packets. Group type 3-4 (G3-4) corresponds to a grouptype configured by combining (d) of FIG. 8 and (e) of FIG. 9. Herein,the mobile service data of the second mobile mode are assigned (orallocated) only to regions A, B, C, D, and E. Herein, region E includes34 data packets. And, group type 3-8 (G3-8) corresponds to a group typeconfigured by combining (d) of FIG. 8 and (f) of FIG. 9. Herein, themobile service data of the second mobile mode are assigned (orallocated) only to regions A, B, C, D, and E. Herein, region E includes30 data packets.

More specifically, the group format of group type 2 and the group formatgroup type 3 are identical to one another. In other words, the samegroup map may be used for group type 2 and group type 3.

In FIG. 10, group type 4 (G3) is not further segmented to a lower-levelgroup type. And, in this case, the 156 data packets are all used for themobile service data. At this point, mobile service data are alsoassigned to an MPEG header and RS parity data positions within the 156data packets.

In other words, in the case where the data group does not include mainservice data, the RS parity and the MPEG header for backwardcompatibility need not be used, such that an area reserved for the RSparity and the MPEG header is allocated to an area for mobile servicedata and forms a block contained in the E region.

At this point, a parade includes group divisions of groups having thesame group type. For example, an arbitrary primary parade is configuredof primary group divisions of groups corresponding to group type 1-1. Inother words, the data of one parade are assigned and transmitted togroup divisions of groups having the same group type. For example, thedata of an arbitrary primary parade are assigned and transmitted to aprimary group division of groups having the same group type.

Meanwhile, the primary parade and the second parade according to theembodiment of the present invention share the same parade identifier andthe same Number Of Group (NOG). Herein, the NOG refers to a number ofgroups within one subframe. For example, when the NOG of the primaryparade is equal to 4, the NOG of the secondary parade should also beequal to 4. More specifically, the secondary parade always forms a pairwith the primary parade and is dependent to the primary parade.Therefore, each of the secondary parades is transmitted through the sameslot as that of its paired primary parade.

Conversely, the overlay parade is not paired with the primary parade.More specifically, although the secondary parade and the overlay paradeare both transmitted through a secondary group division within a group,the overlay parade is not dependent to the corresponding primary parade.Therefore, each of the primary parade and the overlay parade has adifferent parade identifier, and the NOG of each of the primary paradeand the overlay parade may either be identical to one another or bedifferent from one another. More specifically, the NOG boundary of theprimary parade may be different from the NOG boundary of the overlayparade. Nevertheless, the overlay parade includes secondary groupdivisions of groups having the same group type. In other words, the dataof the overlay parade are transmitted through the secondary groupdivisions of groups having the same group type. Accordingly, in order tohave the receiving system receive and process the overlay parade,signaling information of the overlay parade is required. The signalinginformation may correspond to a number of overlay parades being assignedto one subframe, an identifier of each overlay parade, and so on.According to the embodiment of the present invention, the signalinginformation of the overlay parade is inserted in at least one of a fieldsynchronization region and a signaling information region within agroup, so as to be transmitted. The signaling method of the overlayparade will be described in detail later on.

At this point, a method of assigning (or allocating) groups to each slotmay be identically applied to all subframes within a single M/H frame.Alternatively, the method of assigning (or allocating) groups to eachslot may be differently applied for each subframe. At this point, whenit is assumed that group assignment (or allocation) is identicallyapplied to all subframes within the M/H frame, the number of groupsbeing assigned to one M/H frame becomes a multiple of 5.

Also, according to the embodiment of the present invention, a pluralityof groups included in one parade is assigned to be spaced apart as faraway from one another as possible within the subframe. Thus, the datamay be able to respond with robustness against burst errors that mayoccur within a subframe.

For example, when it is assumed that 3 groups are assigned (orallocated) to one subframe, each group is assigned to a first slot (Slot#0), a fifth slot (Slot #4), and a ninth slot (Slot #8) within thecorresponding subframe. Accordingly, when it is assumed that 16 groupsare assigned to one subframe by using the above-described assignment (orallocation) rule, the 16 groups are assigned by the order of Slot #0,Slot #4, Slot #8, Slot #12, Slot #2, Slot #6, Slot #10, Slot #14, Slot#1, Slot #5, Slot #9, Slot #13, Slot #3, Slot #7, Slot #11, and Slot#15.

Equation 1 below shows the above-described rule for assigning aplurality of groups to one sub-frame in the form of a mathematicalequation.

$\begin{matrix}{{j = {\left( {{4i} + O} \right){mod}\; 16}}{{Herein},\begin{matrix}{{O = {{0\mspace{20mu}{if}\mspace{14mu} i} < 4}},} \\{{= {{2\mspace{14mu}{else}\mspace{14mu}{if}\mspace{14mu} i} < 8}},} \\{{= {{1\mspace{14mu}{else}\mspace{11mu}{if}\mspace{14mu} i} < 12}},} \\{= {3\mspace{14mu}{{else}.}}}\end{matrix}}} & \left\lbrack {{Equation}\mspace{14mu} 1} \right\rbrack\end{matrix}$

Also, j indicates the slot number within one subframe. Herein, j mayhave a value ranging from 0 to 15. Furthermore, i represents a groupnumber. Herein, i may have a value also ranging from 0 to 15.

At this point, groups respective to one parade may be assigned to onesubframe. Alternatively, groups respective to a plurality of parades mayalso be assigned to one subframe. The assignment of groups respective toa plurality of parades is no different from (or identical to) theassignment of group respective to a single parade. More specifically,groups within another parade being assigned to one M/H frame arerespectively assigned at a cycle period of 4 slots. At this point, thegroup of the other parade may be assigned in a type of circular methodstarting from a slot that is not assigned with a group of a previousparade.

Furthermore, according to the embodiment of the present invention, whena plurality of parades is assigned to one subframe, the overlay paradeis first assigned.

At this point, the corresponding group may include only primary groupdivisions, or may include both primary group divisions and secondarygroup divisions. Also, data of a primary parade may be assigned to theprimary group divisions, and data of a secondary parade or an overlayparade may be assigned to the secondary group divisions. Morespecifically, data of one parade or data of two parades may be assignedto one group.

FIG. 11 illustrates a data group including (118+M) mobile service datapackets according to an embodiment of the present invention.

Referring to FIG. 11 (a), the data group includes A, B, C, D and Eregions. The data group is contained in a slot including 156 packets.That is, a predetermined number of packets contained in one slot formthe data group, and such packets include mobile service data.

After 118 mobile service data packets fixed in the data group areinterleaved, the data group is divided into A, B, C and D regions asshown in FIG. 6.

Meanwhile, a variable number (M) of mobile service data packets capableof being contained in the data group are contained in an additionalregion E. In the case where the data group in one slot is composed of118 mobile service data packets, the E region can be defined as aspecific region acquired when mobile service data packets are added tothe region composed of only main service data packets. In other words,the E region may include a scalable number of mobile service datapackets in one slot.

The mapping format of the mobile service data packets in the E regionmay be changed according to the intention of a designer. In other words,according to one embodiment of the present invention, when the number ofmobile service data packets is 38 or less (i.e., M<38) as shown in FIG.11( a), specific packet region in one slot remains empty in such amanner that the empty specific packet region can be used as a mainservice data packet region, and therefore mobile service data packetscan be mapped to the remaining parts. According to another embodiment ofthe present invention, mobile service data packets can be mapped to thedata group in such a manner that M scalable mobile service data packetscontained in the E region are spaced apart from one another at intervalsof a predetermined distance.

FIG. 11( b) illustrates a structure acquired after the data groupincluding the E region as shown in FIG. 11( a) is interleaved.

As can be seen from FIG. (b) of 11, the data group including 118 mobileservice data packets can be divided into four regions A, B, C and D. TheA region is located at the center of the data group, and the B region islocated at the exterior of the A region using the A region as areference line. The C region is located at the exterior of the B regionon the basis of the A and B regions. The D region is located at theexterior of the C area on the basis of the A, B, and C regions. The datagroup further includes the E region in which a plurality of blocksincludes the scalable number of mobile data packets.

Referring to FIG. 11( b), 10 blocks (B1˜B10) contained in the data groupform A, B, C and D regions using the same pattern as in the data groupshown in FIG. 6. However, the E region including M scalable mobileservice data packets is formed as an additional block.

As can be seen from FIG. 11( b), the E region belonging to the datagroup may be contained in a plurality of blocks, and respective blocksmay correspond to a scalable number of VSB segments. Mobile service dataadditionally transmitted through the E region is distributed to 4 or 5blocks.

Meanwhile, in the case where the data group does not include mainservice data, the E region includes a block which includes an area of aplace-holder that includes not only an RS parity but also an MPEG headerfor backward compatibility with a conventional digital broadcast system.In other words, in the case where the data group does not include mainservice data, the RS parity and the MPEG header for backwardcompatibility need not be used, such that an area reserved for the RSparity and the MPEG header is allocated to an area for mobile servicedata and forms a block contained in the E region.

Although 5 blocks are contained in the E region as shown in FIG. 11( b),the scope or spirit of the present invention is not limited onlythereto. That is, the number of segments contained in each block of theE region may be scalable, such that the number of blocks contained inthe E regions may also be scalable.

In the meantime, according to the present invention, the E regioncontained in the data group is determined by M scalable mobile servicedata packets, such that an appropriate number of mobile service datapackets can be transmitted according to an amount of mobile service datato be transmitted, resulting in an increased transmission efficiency.

In addition, additional mobile service data packets are transmittedthrough the E regain of the data group, such that the demand of a userwho desires to use a high-quality mobile service that requires a largeamount of data can be satisfied.

In the present invention, the blocks included in the A, B, C and Dregions may be referred to as first blocks or B1, B2, . . . , and theblocks included in the E region may be referred to as second blocks, Eblocks (EBs) or scalable blocks.

Referring to FIG. 11( b), one segment may be shared between differentblocks. In the B8 block, the B9 block and the EB1 block, the B8 blockand the B9 block include 16 segments and the EB1 block includes 31 or 32segments. The 31 or 32 segments included in the EB1 block becomesegments including data included in the B8 block and the B9 block in arow direction. In the data group, one segment may be shared between themobile data block and the scalable block.

FIG. 12 illustrates an example of allocating a plurality of parades toone subframe within an M/H frame according to an embodiment of thepresent invention.

As shown in FIG. 12, groups of a plurality of parades may be assigned toslot positions according to the assignment rule of Equation 1.

Referring to FIG. 12, 7 primary parades (Parade #1 to Parade #7), 3overlay parades (Parade #8 to Parade #10), and 2 secondary parades(Parade #11 and Parade #12) are assigned to 16 slots.

At this point, groups of group type 1 are assigned to Slot #0, Slot #4,Slot #8, Slot #12, Slot #2, and Slot #6, and groups of group type 2 areassigned to Slot #10, Slot #14, and Slot #1. Also, groups of group type1 are assigned to Slot #5 and Slot #9, groups of group type 2 areassigned to Slot #13, Slot #3, and Slot #7, and groups of group type 3are assigned to Slot #11 and Slot #15. More specifically, the secondarygroup division of the groups being assigned to Slot #0, Slot #4, Slot#8, Slot #12, Slot #2, and Slot #6 includes region E. And, mobileservice data of the second mobile mode are transmitted to region E.

For example, data of primary parade #1 are assigned to a primary groupdivision of the groups being assigned to Slot #0, Slot #4, Slot #8, andSlot #12, and data of primary parade #2 are assigned to a primary groupdivision of the groups being assigned to Slot #2 and Slot #6. Morespecifically, the NOG of primary parade #1 is equal to 4, and the NOG ofprimary parade #2 is equal to 2. Conversely, data of overlay parade #8are assigned to a secondary group division of the groups being assignedto Slot #0, Slot #4, and Slot #8, and data of overlay parade #9 areassigned to a secondary group division of the groups being assigned toSlot #12, Slot #2, and Slot #6. More specifically, the NOG of overlayparade #8 is equal to 3, and the NOG of overlay parade #9 is also equalto 3. As described above, the overlay parades are not dependent to theprimary parades. And, accordingly, the NOG values are also differentfrom one another. In some cases, however, the NOG values may beidentical. Nevertheless, the parade identifiers are different from oneanother.

In another example, since the groups assigned to Slot #0, Slot #4, Slot#8, Slot #12, Slot #2, and Slot #6 correspond to the same group type(e.g., group type 1), the groups assigned to Slot #0, Slot #4, Slot #8,Slot #12, Slot #2, and Slot #6 may be included in a single overlayparade as a collection of secondary group divisions of the groupsassigned to Slot #0, Slot #4, Slot #8, Slot #12, Slot #2, and Slot #6.

Furthermore, data of primary parade #3 are assigned to the primary groupdivision of the groups being transmitted to Slot #10 and Slot #14. And,data of primary parade #4 are assigned to the primary group division ofthe group being transmitted to Slot #1. More specifically, the NOG ofprimary parade #3 is equal to 2, and the NOG of primary parade #4 isequal to 1. Conversely, data of overlay parade #10 are assigned to asecondary group division of the groups being assigned to Slot #10, Slot#14, and Slot #1. More specifically, the NOG of overlay parade #10 isequal to 3.

In yet another example, data of primary parade #5 are assigned to theprimary group division of the groups being transmitted to Slot #5 andSlot #9. And, data of secondary parade #11 are assigned to the secondarygroup division of the groups being transmitted to Slot #5 and Slot #9.More specifically, the NOG of primary parade #5 and the NOG of secondaryparade #11 are both equal to 2. As described above, the secondary paradeforms a pair with the primary parade, and the primary parade and thesecondary parade share the same NOG and the same parade identifier.

In yet another example, data of primary parade #6 are assigned to theprimary group division of the groups being transmitted to Slot #13, Slot#3, and Slot #7. And, data of secondary parade #13 are assigned to thesecondary group division of the groups being transmitted to Slot #13,Slot #3, and Slot #7. More specifically, the NOG of primary parade #6and the NOG of secondary parade #13 are both equal to 3.

In yet another example, the groups being transmitted to Slot #11 andSlot #15 are included in the primary group division, and data of theprimary parade #7 are assigned to the primary group division. Morespecifically, the primary group division of the groups being transmittedto Slot #11 and Slot #15 includes regions A, B, C, D, and E. And, mobileservice data of the second mobile mode are assigned to regions A, B, C,D, and E.

As described above, groups of a plurality of parades may be assigned toone M/H frame. And, the assignment of the groups in one subframe isperformed in series (or serially performed) from left to right having agroup space of 4 slots. Also, when an overlay parade is included in theplurality of parades being assigned to one subframe, the groups of theoverlay parade are assigned first. In case of FIG. 12, the groups ofgroup type 1 including the secondary group division having data ofoverlay parade #8 assigned thereto are assigned first. Then, the groupsof group type 1 including the secondary group division having data ofoverlay parade #9 assigned thereto are assigned afterwards. Thereafter,the groups of group type 2 including the secondary group division havingdata of overlay parade #10 assigned thereto are assigned. In case aplurality of overlay parades are assigned to one subframe, the order ofassignment may be arbitrarily decided, or the order of assignment may bedecided based upon a pre-arranged agreement.

FIG. 13 illustrates the relation between a super ensemble, a super RSframe, and two parades according to an embodiment of the presentinvention.

The super RS frame payload corresponds to a super RS frame, which isprocessed with RS-CRC encoding. Also, the super RS frame is transmittedthrough 2 random parades. At this point, the parade type of the twoparades may be identical to one another or may be different from oneanother.

More specifically, super RS frame payload #1 is RS-CRC encoded so as toform super RS frame #1. And, super RS frame #1 is transmitted throughparade #1 and parade #2. At this point, the parade types of parade #1and parade #2 may not be identical to one another. For example, parade#1 may correspond to a secondary parade, and parade #2 may correspond toan overlay parade. In other words, parade #1 and parade #2 may be usedto form one super RS frame.

Also, super RS frame payload #2 is RS-CRC encoded so as to form super RSframe #2. And, super RS frame #2 is transmitted through parade #3 andparade #4. At this point, also, the parade types of parade #3 and parade#4 may not be identical to one another. For example, parade #3 maycorrespond to a secondary parade, and parade #4 may correspond to aprimary parade. In other words, parade #3 and parade #4 may be used toform one super RS frame.

As described above, the parade types of the two parades that transmit asingle super RS frame are independent from one another.

FIG. 14 illustrates an example of allocating parade #1 of group type 4and having an NOG of 5, parade #2 of group type 4 and having an NOG of3, and parade #3 of group type 4 and having an NOG of 8 to a subframeaccording to an embodiment of the present invention.

When it is assumed that the conventional data transmission rate is equalto 19.39 Mbps, and if the group corresponds to group type 4, the datatransmission rate of group type 4 becomes greater than 19.39 Mbps. FIG.14 shows an example of the data transmission rate increasing to 21.35Mbps.

Meanwhile, among the above-described group types, group type 4corresponds to a 100% full-channel mobile mode. Herein, the mobileservice data being assigned to the group of group type 4 are notrequired to be backward compatible with the main service. Also, in orderto increase the mobile channel capacity, only the actual mobile servicedata are assigned to the group of group type 4, and, accordingly, theMPEG header (i.e., TS packet header) or RS parity data are not assigned.More specifically, mobile service data are also assigned MPEG header andRS parity data positions.

FIG. 15 illustrates group type 0 of data group, according to anembodiment of the present invention.

According to FIG. 15, a structure acquired before a data group isinterleaved, when the data group includes 118 mobile service datapackets.

Referring to FIG. 15, the data group includes 118 TS packets thatinclude at least one of FEC-encoded mobile service data, MPEG header,trellis initialization data, known data, signaling data, RS parity dataand dummy data. For convenience of description and better understandingof the present invention, a TS packet contained in the data group isdefined as a mobile service data packet according to the presentinvention.

The data group shown in FIG. 15 includes 118 mobile service datapackets, such that it can be recognized that the slot via which theabove-mentioned data group is transmitted is used for transmitting 38main service data packets.

FIG. 16 illustrates a structure acquired after a group type 0 of datagroup data group is interleaved, when the data group includes 118 mobileservice data packets, according to an embodiment of the presentinvention.

Referring to FIG. 16, the data group including 118 mobile service datapackets is interleaved such that a data group including 170 segments isformed.

In this case, the above-mentioned example in which 118 mobile servicedata packets are distributed to 170 segments has been disclosed only forillustrative purposes and better understanding of the present invention.The number of data segments formed after the data group is interleavedmay be changed to another according to the degree of interleaving.

FIG. 16 shows an example of dividing a data group prior to beingdata-interleaved into 10 data blocks (i.e., data block 1 (B1) to datablock 10 (B10)). In other word, data block can be defined as atransmission block containing mobile service data or main and mobileservice data in segment level. In this example, each data block has thelength of 16 segments. Referring to FIG. 16, only the RS parity data areallocated to a portion of 5 segments before the data block 1 (B1) and 5segments behind the data block 10 (B10). The RS parity data are excludedin regions A to D of the data group.

More specifically, when it is assumed that one data group is dividedinto regions A, B, C, and D, each data block may be included in any oneof region A to region D depending upon the characteristic of each datablock within the data group. At this point, according to an embodimentof the present invention, each DATA block may be included in any one ofregion A to region D based upon an interference level of main servicedata.

Herein, the data group is divided into a plurality of regions to be usedfor different purposes. More specifically, a region of the main servicedata having no interference or a very low interference level may beconsidered to have a more resistant (or stronger) receiving performanceas compared to regions having higher interference levels. Additionally,when using a system inserting and transmitting known data in the datagroup, wherein the known data are known based upon an agreement betweenthe transmitting system and the receiving system, and when consecutivelylong known data are to be periodically inserted in the mobile servicedata, the known data having predetermined length may be periodicallyinserted in the region having no interference from the main service data(i.e., a region wherein the main service data are not mixed). However,due to interference from the main service data, it is difficult toperiodically insert known data and also to insert consecutively longknown data to a region having interference from the main service data.

Referring to FIG. 16, data block 4 (B4) to data block 7 (B7) correspondto regions without interference of the main service data. data block 4(B4) to data block 7 (B7) within the data group shown in FIG. 16correspond to a region where no interference from the main service dataoccurs. In this example, a long known data sequence is inserted at boththe beginning and end of each data block. In the description of thepresent invention, the region including data block 4 (B4) to data block7 (B7) will be referred to as “region A (=B4+B5+B6+B7)”. As describedabove, when the data group includes region A having a long known datasequence inserted at both the beginning and end of each data block, thereceiving system is capable of performing equalization by using thechannel information that can be obtained from the known data. Therefore,the strongest equalizing performance may be yielded (or obtained) fromone of region A to region D.

In the example of the data group shown in FIG. 16, data block 3 (B3) anddata block 8 (B8) correspond to a region having little interference fromthe main service data. Herein, a long known data sequence is inserted inonly one side of each data block B3 and B8. More specifically, due tothe interference from the main service data, a long known data sequenceis inserted at the end of data block 3 (B3), and another long known datasequence is inserted at the beginning of data block 8 (B8). In thepresent invention, the region including data block 3 (B3) and data block8 (B8) will be referred to as “region B(=B3+B8)”. As described above,when the data group includes region B having a long known data sequenceinserted at only one side (beginning or end) of each data block, thereceiving system is capable of performing equalization by using thechannel information that can be obtained from the known data. Therefore,a stronger equalizing performance as compared to region C/D may beyielded (or obtained).

Referring to FIG. 16, data block 2 (B2) and data block 9 (B9) correspondto a region having more interference from the main service data ascompared to region B. A long known data sequence cannot be inserted inany side of data block 2 (B2) and data block 9 (B9). Herein, the regionincluding data block 2 (B2) and data block 9 (B9) will be referred to as“region C(=B2+B9)”.

Finally, in the example shown in FIG. 16, data block 1 (B1) and datablock 10 (B10) correspond to a region having more interference from themain service data as compared to region C. Similarly, a long known datasequence cannot be inserted in any side of data block 1 (B1) and datablock 10 (B10).

Referring to FIG. 16, it can be readily recognized that the regions Aand B of the data group includes signaling data used for signaling at areception end.

FIG. 17 illustrates group type 1-0 of data group, according to anembodiment of the present invention.

According to FIG. 17, a structure provided before a data group isinterleaved, when the data group includes (118+38) mobile service datapackets.

Referring to FIG. 17, the data group includes mobile service data of theA and B regions, mobile service data of the C and D regions, mobileservice data of the E region, an MPEG header, trellis initializationdata, known data, signaling data, RS parity data, and dummy data.

As shown in FIG. 17, the E region has no main service data packets, suchthat the region for the RS parity and the MPEG header is not present inthe E region. Therefore, the above-mentioned regions may be adapted totransmit mobile service data, such that much more mobile service datacan be transmitted.

FIG. 18 illustrates a structure provided after a group type 1-0 of datagroup is interleaved when the data group includes (118+38) mobileservice data packets according to an embodiment of the presentinvention.

The structure shown in FIG. 18 is identical to a structure formed afterthe data group of FIG. 17 is interleaved.

As can be seen from the data group shown in FIG. 18, the primaryensemble is transmitted through the A, B, C and D regions of the datagroup, and the secondary ensemble is transmitted through the E region ofthe data group. Since the A, B, C and D regions are identical to thoseof a conventional data group, they can maintain the compatibility with aconventional digital mobile broadcast system. In addition, additionalmobile service data can be transmitted through the E region.

Although the data group of FIG. 18 is divided into 10 blocks belongingto the A, B, C and D regions and five additional blocks belonging to theE region, the number of blocks belonging to the E block is not limitedonly to ‘5’ and may be changed to another number not ‘5’ according tothe intention of a designer.

Referring to FIG. 18, known data is inserted into the E region.Therefore, the reception performance of the reception end is increasedin the E region. As described above, mobile service data is insertedinto the reserved area for both the RS parity and the MPEG headerpresent in the E region, such that much more mobile service data can betransmitted.

FIG. 19 illustrates group type 1-1 of data group, according to anembodiment of the present invention.

According to FIG. 19, a structure provided before a data group isinterleaved, when the data group includes (118+37) mobile service datapackets.

Referring to FIG. 19, the data group includes mobile service data of theA and B regions, mobile service data of the C and D regions, mobileservice data of the E region, an MPEG header, trellis initializationdata, known data, signaling data, RS parity data, and dummy data.

As shown in FIG. 19, one main service data packet may be inserted inregion E. In the conventional broadcasting system, an error may occurwhen main data are not received for a long period of time. However, byinserting the main service data packet, as described above, such errormay be prevented.

FIG. 20 illustrates a structure provided after a group type 1-1 of datagroup is interleaved when the data group includes (118+37) mobileservice data packets according to an embodiment of the presentinvention.

The structure shown in FIG. 20 is identical to a structure formed afterthe data group of FIG. 19 is interleaved.

As can be seen from the data group shown in FIG. 20, the primaryensemble is transmitted through the A, B, C and D regions of the datagroup, and the secondary ensemble is transmitted through the E region ofthe data group. Since the A, B, C and D regions are identical to thoseof a conventional data group, they can maintain the compatibility with aconventional digital mobile broadcast system. In addition, additionalmobile service data can be transmitted through the E region.

Furthermore, the data that are transmitted through regions A, B, C, andD may be validly decoded by the conventional mobile broadcasting system.However, although the data that are transmitted through region E can bereceived by the conventional mobile broadcasting system, thecorresponding data cannot be processed as valid information.

Although the data group of FIG. 20 is divided into 10 blocks belongingto the A, B, C and D regions and five additional blocks belonging to theE region, the number of blocks belonging to the E block is not limitedonly to ‘5’ and may be changed to another number not ‘5’ according tothe intention of a designer.

Referring to FIG. 20, known data is inserted into the E region.Therefore, the reception performance of the reception end is increasedin the E region. As described above, mobile service data is insertedinto the reserved area for both the RS parity and the MPEG headerpresent in the E region, such that much more mobile service data can betransmitted.

FIG. 21 illustrates group type 1-2 of data group, according to anembodiment of the present invention.

According to FIG. 21, a structure provided before a data group isinterleaved, when the data group includes (118+36) mobile service datapackets.

FIG. 22 illustrates a structure provided after a group type 1-2 of datagroup is interleaved when the data group includes (118+36) mobileservice data packets according to an embodiment of the presentinvention.

The structure shown in FIG. 22 is identical to a structure formed afterthe data group of FIG. 21 is interleaved.

FIG. 23 illustrates group type 1-4 of data group, according to anembodiment of the present invention.

According to FIG. 23, a structure provided before a data group isinterleaved, when the data group includes (118+34) mobile service datapackets.

FIG. 24 illustrates a structure provided after a group type 1-4 of datagroup is interleaved when the data group includes (118+34) mobileservice data packets according to an embodiment of the presentinvention.

The structure shown in FIG. 24 is identical to a structure formed afterthe data group of FIG. 23 is interleaved.

FIG. 25 illustrates group type 1-8 of data group, according to anembodiment of the present invention.

According to FIG. 25, a structure provided before a data group isinterleaved, when the data group includes (118+30) mobile service datapackets.

FIG. 26 illustrates a structure provided after a group type 1-8 of datagroup is interleaved when the data group includes (118+30) mobileservice data packets according to an embodiment of the presentinvention.

The structure shown in FIG. 26 is identical to a structure formed afterthe data group of FIG. 25 is interleaved.

The descriptions of FIG. 18 and FIG. 19 may be similarly applied to thedata groups shown in FIG. 20 to FIG. 26.

In the description of FIG. 17 to FIG. 26, although number of mainservice data packets included in a data group is limited to a specificnumber, the number is merely exemplary. Therefore, the present inventionwill not be limited only to the limited number of data packets proposedin the description of the present invention.

FIG. 27 illustrates group type 2-0 of data group, according to anembodiment of the present invention.

According to FIG. 27, a structure provided before a data group isinterleaved, when the data group includes (118+38) mobile service datapackets.

Referring to FIG. 27, the data group includes mobile service data of theA and B regions, mobile service data of the C and D regions, mobileservice data of the E region, an MPEG header, trellis initializationdata, known data, signaling data, RS parity data, and dummy data.

FIG. 28 illustrates a structure provided after a group type 2-0 of datagroup is interleaved, when the data group includes (118+38) mobileservice data packets, according to an embodiment of the presentinvention.

The structure shown in FIG. 28 is identical to a structure formed afterthe data group of FIG. 27 is interleaved.

As can be seen from the data group shown in FIG. 28, the primaryensemble is transmitted through the A and B regions of the data group,and the secondary ensemble is transmitted through the C, D and E regionof the data group. Since the A and B regions include the RS parity andthe MPEG header, they can maintain the compatibility with a conventionaldigital mobile broadcast system.

Furthermore, the data that are transmitted through regions A and B maybe validly decoded by the conventional mobile broadcasting system.However, although the data that are transmitted through regions C, D,and E can be received by the conventional mobile broadcasting system,the corresponding data cannot be processed as valid information.

Although the data group of FIG. 28 is divided into 10 blocks belongingto the A, B, C and D regions and five additional blocks belonging to theE region, the number of blocks belonging to the E block is not limitedonly to ‘5’ and may be changed to another number not ‘5’ according tothe intention of a designer.

Referring to FIG. 28, additional known data is inserted into the C and Dregions in addition to the A and B regions. The data group shown in FIG.28 is not affected by main service data, such that successive known datasequences can be contained in the C and D regions differently from thedata group shown in FIG. 18. Therefore, the reception performance ofmobile service data transmitted through the C and D regions at thereception end can be greatly increased.

In accordance with the present invention, the number of known datasequences inserted into the C and D regions is not limited only to aspecific number. Therefore, according to the intention of a designer, aproper number of known data sequences required for enhancing thereception performance of the reception end can be inserted. Inaccordance with one embodiment of the present invention, 3 known datasequences are inserted into the C region, and 2 known data sequences areinserted into the D region.

FIG. 29 illustrates group type 2-1 of data group, according to anembodiment of the present invention.

According to FIG. 29, a structure provided before a data group isinterleaved, when the data group includes (118+37) mobile service datapackets.

Referring to FIG. 29, the data group includes mobile service data of theA and B regions, mobile service data of the C and D regions, mobileservice data of the E region, an MPEG header, trellis initializationdata, known data, signaling data, RS parity data, and dummy data.

As shown in FIG. 29, one main service data packet may be inserted inregion E. In the conventional broadcasting system, an error may occurwhen main data are not received for a long period of time. However, byinserting the main service data packet, as described above, such errormay be prevented.

FIG. 30 illustrates a structure provided after a group type 2-1 of datagroup is interleaved when the data group includes (118+37) mobileservice data packets according to an embodiment of the presentinvention.

The structure shown in FIG. 30 is identical to a structure formed afterthe data group of FIG. 29 is interleaved.

FIG. 31 illustrates group type 2-2 of data group, according to anembodiment of the present invention.

According to FIG. 31, a structure provided before a data group isinterleaved, when the data group includes (118+36) mobile service datapackets.

FIG. 32 illustrates a structure provided after a group type 2-2 of datagroup is interleaved when the data group includes (118+36) mobileservice data packets according to an embodiment of the presentinvention.

The structure shown in FIG. 32 is identical to a structure formed afterthe data group of FIG. 31 is interleaved.

FIG. 33 illustrates group type 2-4 of data group, according to anembodiment of the present invention.

According to FIG. 33, a structure provided before a data group isinterleaved, when the data group includes (118+34) mobile service datapackets.

FIG. 34 illustrates a structure provided after a group type 2-4 of datagroup is interleaved when the data group includes (118+34) mobileservice data packets according to an embodiment of the presentinvention.

The structure shown in FIG. 34 is identical to a structure formed afterthe data group of FIG. 33 is interleaved.

FIG. 35 illustrates group type 2-8 of data group, according to anembodiment of the present invention.

According to FIG. 35, a structure provided before a data group isinterleaved, when the data group includes (118+30) mobile service datapackets.

FIG. 36 illustrates a structure provided after a group type 2-9 of datagroup is interleaved when the data group includes (118+30) mobileservice data packets according to an embodiment of the presentinvention.

The structure shown in FIG. 36 is identical to a structure formed afterthe data group of FIG. 35 is interleaved.

Referring to the data group structure of FIG. 27 to FIG. 36, a group isdivided into 12 DATA blocks (MH blocks B0 to B11) for the first mobilemode. Additionally, the group is also divided into 5 extended DATAblocks (MH blocks EB0 to EB4) for the second mobile mode.

At this point, the receiving system for the first mobile mode mayreceive and process only the data of 6 DATA blocks (MH blocks B3 to B8).And, the receiving system for the second mobile mode may receive alldata of the 12 DATA blocks (MH blocks B0 to B11) and all data of the 5extended DATA blocks (MH blocks EB0 to EB4), so as to process both themobile data of the first mobile mode and the mobile data of the secondmobile mode.

Meanwhile, group type 3 is segmented to 5 group types (group type 3-0,3-1, 3-2, 3-4, and 3-8), depending upon the number of mobile servicedata packets of the region E. In the group of group type 3, the primarygroup division includes regions A, B, C, D, and E, and the secondarygroup division does not exist. More specifically, according to theembodiment of the present invention, in the primary group division,mobile service data for the second mobile mode are assigned to regionsA, B, C, D, and E, and mobile service data of the first mobile mode arenot assigned to the primary group division. At this point, the groupformat of group type 3 is identical to the group format of group type 2.Therefore, reference may be made to the descriptions of FIG. 27 to FIG.36 for the description of the data groups of each sub group type 3-0,3-1, 3-2, 3-4, and 3-8 of group type 3. However, the receiving systemfor the first mobile mode does not process group type 3. And, thereceiving system for the second mobile mode may receive and process alldata of the 12 DATA blocks (MH blocks B0 to B11) and the 5 extended DATAblocks (MH blocks EB0 to EB4).

FIG. 37 illustrates group type 4 of data group, according to anembodiment of the present invention.

According to FIG. 37, a structure provided before a data group isinterleaved, when the data group includes (118+38) mobile service datapackets.

As for the data group shown in FIG. 37, on the condition that 16 slotscontained in one sub-frame transmit a data group including 156 mobileservice data packets, the data group of FIG. 37 may represent any one ofdata group types.

The data group shown in FIG. 37 includes mobile service data of the Aand B regions, mobile service data of the C and D regions, mobileservice data of the E region, trellis initialization data, known data,signaling data, and dummy data. That is, the data group of FIG. 37 doesnot include the RS parity and the MPEG header for backwardcompatibility.

As shown in FIG. 37, the A, B, C, D and E regions do not include theregion for the RS parity and the MPEG header. Therefore, theabove-mentioned regions can be used to transmit mobile service data,such that much more mobile service data can be transmitted.

FIG. 38 illustrates a structure provided after a group type 4 of datagroup is interleaved, when the data group includes (118+38) mobileservice data packets, according to an embodiment of the presentinvention.

The structure shown in FIG. 38 is identical to a structure formed afterthe data group of FIG. 37 is interleaved.

Referring to FIG. 38, additional known data is inserted into the C and Dregions in addition to the A and B regions. The data group shown in FIG.38 is not affected by main service data, such that successive known datasequences can be contained in the C and D regions. Therefore, thereception performance of mobile service data transmitted through the Cand D regions at the reception end can be greatly increased.

In addition, first known data present in the E region of the first datagroup may be connected to second known data present in the upper C and Dregions of the second data group that is adjacent to the first datagroup. In this case, a known data sequence may be assigned to an overallarea of the data group. As a result, the reception performance of mobileservice data in the case of using the overall area of the group ishigher than the reception performance of mobile service data in anothercase of using a conventional data group.

In accordance with another embodiment of the present invention, whenknown data of the first data group is connected to known data of thesecond group that is adjacent to the first data group, known datainstead of trellis initialization data inserted in the front end of eachknown data may be additionally inserted. In this case, the trellisinitialization data to be located at the front end of the connectedknown data sequence should be contained in the data group.

In addition, as shown in FIG. 38, in the A, B, C, D and E regions,mobile service data is inserted into the reserved area for the RS parityand the MPEG header, such that much more mobile service data can betransmitted within one data group.

FIG. 39 is a block diagram illustrating a transmission system accordingto an embodiment of the present invention.

Referring to FIG. 39, the transmission system includes a packetadjustment unit 101, a pre-processor 102, a data frame encoder 103, ablock processor 104, a signaling encoder 105, a group formatter 106, apacket formatter 107, a Packet multiplexer (Packet MUX) 108, apost-processor 109, a modified data randomizer 110, asystematic/non-systematic RS encoder 111, a data interleaver 112, anon-systematic RS encoder 113, a parity replacer 114, a modified trellisencoder 115, a synchronization multiplexer (Sync MUX) 116, a pilotinserter 117, a VSB modulator 118, and a Radio Frequency (RF)up-converter 119. In addition, the transmission system of FIG. 39 mayfurther include a pre-equalizer filter 120.

When a mobile service data packet and a main service data packet aremultiplexed, there may occur a displacement between a service streampacket including a mobile service stream and another service streampacket including no mobile service stream. In order to compensate forthe displacement, the packet adjustment unit 101 may be used.

The pre-processor 102 configures mobile service data in a form of amobile service structure for transmitting the mobile service data. Inaddition, the pre-processor 102 performs additional FEC coding of mobileservice data. Also, the pre-processor 102 inserts known data. That is,the pre-processor 102 increases the stability of transmission andreception of mobile service data under a mobile environment.

The pre-processor 102 may include a data frame encoder (or RS frameencoder, or encoder) 103, a block processor 103, a block processor 104,a signaling encoder 105, a group formatter 106, a packet formatter 107,and a packet multiplexer (packet MUX) 108. In other words, theabove-mentioned constituent components may be contained in thepre-processor 102, and may be configured separately from thepre-processor 102.

The data frame encoder 103 randomizes mobile service data, and performsRS encoding and CRC encoding of the mobile service data.

The block processor 104 converts an RS frame portion into an SCCC block.The block processor 104 converts a mobile service data byte contained inthe SCCC block into bit-based mobile service data. The block processor104 performs convolution encoding of ½, ⅓, or ¼ rate on the bit-basedmobile service data. In this case, the ½ rate means an encoding processin which two bits are output in response to an input of one bit, the ⅓rate means an encoding process in which three bits are output inresponse to an input of two bits, and the ¼ rate means an encodingprocess in which four bits are output in response to an input of fourbits. Output bits are contained in a symbol. The block processor 104performs interleaving of the convolution-encoded output symbol. Theblock processor 104 converts an interleaved symbol into byte-based data,and converts an SCCC block into a data block. A detailed description ofthe data block will hereinafter be described in detail.

The signaling encoder 105 generates signaling information for signalingat a reception end, performs FEC encoding and PCCC encoding of thegenerated signaling information, and inserts the signaling informationinto some regions of the data group. For example, examples of thesignaling information may be a transmission parameter channel (TPC)data, fast information channel (FIC) data, and the like.

The group formatter 106 forms a data group using the output data of theblock processor 104. The group formatter 106 maps FEC-encoded mobileservice data to an interleaved form of a data group format. At thistime, the above-mentioned mapping is characterized in that FEC-encodedmobile service data is inserted into either a data block of acorresponding group or a group region according to a coding rate of eachFEC-encoded mobile service data received from the block processor 104.In addition, the group formatter 106 inserts signaling data, a data byteused for initializing the trellis encoder, and a known data sequence.Further, the group formatter 106 inserts main service data, and aplace-holder for an MPEG-2 header and a non-systematic RS parity. Thegroup formatter 106 may insert dummy data to generate a data group of adesired format. After inserting various data, the group formatter 106performs deinterleaving of data of the interleaved data group. Afterperforming the deinterleaving operation, the data group returns to anoriginal group formed before the interleaving operation.

The packet formatter 107 converts output data of the group formatter 106into a Transport Stream (TS) packet. In this case, the TS packet is amobile service data packet. In addition, the output of the packetformatter 107 according to an embodiment of the present invention ischaracterized in that it includes (118+M) mobile service data packets ina single data group. In this case, M is 38 or less.

The packet multiplexer (Packet MUX) 108 multiplexes a packet includingmobile service data processed by the pre-processor 102 and a packetincluding main service data output from the packet adjustment unit 101.In this case, the multiplexed packet may include (118+M) mobile servicedata packets and L main service data packets. For example, according toan embodiment of the present invention, M is any one of integers from 0to 38, and the sum of M and L is set to 38. In other words, although thepacket multiplexer (packet MUX) 108 may multiplex the mobile servicedata packet and the main service data packet, in the case where thenumber of input main service data packets is set to ‘0’ (i.e., L=0),only the mobile service data packet is processed by the packetmultiplexer (packet MUX) 108, such that the packet multiplexer (packetMUX) 108 outputs the processed mobile service data packet only.

The post-processor 109 processes mobile service data in such a mannerthat the mobile service data generated by the present invention can bebackward compatible with a conventional broadcast system. In accordancewith one embodiment of the present invention, the post-processor 109 mayinclude a modified data randomizer 110, a systematic/non-systematic RSencoder 111, a data interleaver (or interleaver) 112, a non-systematicRS encoder 113, a parity replacer 114 and a modified trellis encoder115. In other words, each of the above-mentioned constituent componentsmay be located outside of the post-processor 109 according to theintention of a designer as necessary.

The modified data randomizer 110 does not perform randomizing of amobile service TS packet, and bypasses a mobile service TS packet. Themodified data randomizer 110 performs randomizing of the main servicedata TS packet. Therefore, according to one embodiment of the presentinvention, the randomizing operation is not performed when a data groupgenerated by the pre-processor 102 has no main service data.

In the case where input data is a main service data packet, thesystematic/non-systematic RS encoder 111 performs systematic RS encodingof the main service data packet acting as the input data, such that itgenerates RS FEC data. In the case where input data is a mobile servicedata packet, the systematic/non-systematic RS encoder 111 performsnon-systematic RS encoding, such that it generates RS FEC data. Inaccordance with one embodiment of the present invention, thesystematic/non-systematic RS encoder 111 generates RS FEC data havingthe size of 20 bytes during the systematic/non-systematic RS encodingprocess. The RS FEC data generated in the systematic RS encoding processis added to the end of a packet having the size of 187 bytes. RS FECdata generated in the non-systematic RS encoding process is insertedinto the position of an RS parity byte predetermined in each mobileservice data packet. Therefore, according to one embodiment of thepresent invention, in the case where the data group generated by thepre-processor has no main service data, the systematic RS encoder 111for main service data performs no RS encoding. In this case, thenon-systematic RS encoder 111 does not generate a non-systematic RSparity for backward compatibility.

The data interleaver 112 performs byte-based interleaving of data thatincludes main service data and mobile service data.

In the case where it is necessary to initialize the modified trellisencoder 115, the non-systematic RS encoder 113 receives an internalmemory value of the modified trellis encoder 115 as an input, andreceives mobile service data from the data interleaver 112 as an input,such that it changes initialization data of mobile service data to amemory value. The non-systematic RS encoder 113 performs non-systematicRS encoding of the changed mobile service data, and outputs thegenerated RS parity to the parity replacer 114.

In the case where it is necessary to initialize the modified trellisencoder 115, the parity replacer 114 receives mobile service data outputfrom the data interleaver 112, and replaces an RS parity of the mobileservice data with an RS parity generated from the non-systematic RSencoder 113.

In the case where the data group generated in the pre-processor does notinclude main service data at all, the data group need not have an RSparity for backward compatibility. Accordingly, in accordance with oneembodiment of the present invention, the non-systematic RS encoder 113and the parity replacer 114 do not perform each of the above-mentionedoperations, and bypass corresponding data.

The modified trellis encoder 115 performs trellis encoding of outputdata of the data interleaver 112. In this case, in order to allow dataformed after the trellis encoding to have known data pre-engaged betweena transmission end and a reception end, a memory contained in themodified trellis encoder 115 should be initialized before the beginningof the trellis encoding. The above-mentioned initialization operationbegins by trellis initialization data belonging to a data group.

The synchronization multiplexer (Sync MUX) 116 inserts a fieldsynchronization signal and a segment synchronization signal into outputdata of the modified trellis encoder 115, and multiplexes the resultantdata.

The pilot inserter 117 receives the multiplexed data from thesynchronization multiplexer (Sync MUX) 116, and inserts a pilot signal,that is used as a carrier phase synchronization signal for demodulatinga channel signal at a reception end, into the multiplexed data.

The VSB modulator 118 performs VSB modulation so as to transmit data.

The transmission unit 119 performs frequency up-conversion of themodulated signal, and transmits the resultant signal.

In the present invention, the transmitting system provides backwardcompatibility in the main service data so as to be received by theconventional receiving system. Herein, the main service data and themobile service data are multiplexed to the same physical channel andthen transmitted.

Furthermore, the transmitting system according to the present inventionperforms additional encoding on the mobile service data and inserts thedata already known by the receiving system and transmitting system(e.g., known data), thereby transmitting the processed data.

Therefore, when using the transmitting system according to the presentinvention, the receiving system may receive the mobile service dataduring a mobile state and may also receive the mobile service data withstability despite various distortion and noise occurring within thechannel.

FIG. 40 illustrates an embodiment of a bitstream syntax structure ofsignaling overlay data sig_overlay_data( ) for overlay parade relatedsignaling information according to the present invention.

Signaling overlay data sig_overlay_data( ) shown in FIG. 40 A providessignaling information of all overlay parades transmitted through onesubframe.

A (4-bit) num_overlay_parade field in the signaling overlay datasig_overlay_data( ) indicates the number of overlay parades transmittedthrough one subframe.

A (16-bit) overlay_parade_map field indicates the NOG of each overlayparade transmitted through the subframe. In an embodiment of the presentinvention, one of the 16 bits, which corresponds to the NOG of acorresponding overlay parade, is set to “1” to indicate the NOG of theoverlay parade.

For example, let us assume that the num_overlay_parade field value is 3,i.e., that 3 overlay parades are transmitted through the subframe. Inaddition, let us assume that the NOG of the first overlay parade is 4,the NOG of the second overlay parade is 6, and the NOG of the thirdoverlay parade is 5. In this case, the fourth of the 16 bits of theoverlay_parade_map field is set to “1”, the sixth bit, counted from thefourth bit, is set to “1”, and the fifth bit, counted from the sixthbit, is set to “1” and the overlay_parade_map field is then insertedinto an FSSC of a corresponding field synchronization segment. That is,when the overlay_parade_map field value is “0001000001000010”, thereceiving system can determine that the NOG of the first overlay paradeis 4, the NOG of the second overlay parade is 6, and the NOG of thethird overlay parade is 5. In another example, the overlay_parade_mapfield value is “01001000010000” when the NOG of the first overlay paradeis 2, the NOG of the second overlay parade is 3, and the NOG of thethird overlay parade is 5.

The loop is performed a number of times corresponding to thenum_overlay_parade field value to provide an identifier for each overlayparade. For example, when the num_overlay_parade field value is 3, theloop is repeated 3 times to provide three overlay parade identifiers. Toaccomplish this, the loop includes a (16-bit) overlay_parade_id field.

Then, an 8-bit CRC code for error correction is inserted.

Here, if the signaling information of the overlay parade signaledthrough the signaling overlay data sig_overlay_data( ) is less than 96bits, a reserved field is used to increase the signaling information to96 bits.

As shown in FIG. 40 B, the 96 bits are divided into 12-bit units whichare then input to a (64, 12) Kerdock encoder 4000. The (64, 12) Kerdockencoder 4000 encodes 12 input bits using a Kerdock coding algorithm tocreate 64 bits and outputs the 64 bits to an (8×64) block interleaver4001.

The block interleaver 4001 is a variable-length block interleaver thatinterleaves overlay parade signaling data, which has been Kerdockencoded and then has been input in units of 64 bits, in units of 8×64blocks as shown in FIG. 40.

The block interleaver 4001 writes the 64-bit overlay parade signalingdata in a left to right direction and then in a downward direction on arow by row basis and reads the overlay parade signaling data in adownward direction and then in a left to right direction on a column bycolumn basis and outputs the read overlay parade signaling in units of64 bits.

As shown in FIG. 40B, the provided 96-bit overlay parade signalinginformation is converted into 512 bits via the Kerdock encoder 5000 andthe block interleaver 5001. In an embodiment of the present invention,the 512-bit overlay parade signaling information is divided into eight64-bit units and the eight 64-bit units are then sequentially insertedinto eight field Syncs in a corresponding subframe as shown in FIG. 40B.

On the other hand, in an embodiment of the present invention, 2 bits ofthe TPC data are used to indicate whether or not an overlay parade ispresent and version information of the overlay parade. In the presentinvention, the 2 bits are referred to as an “overlay_group_statusfield”.

That is, since the overlay parade configuration may vary in each M/Hframe, the overlay_group_status field indicates whether an overlayparade is present in the corresponding M/H frame. When an overlay paradeis present, the overlay_group_status field also indicates versioninformation of the overlay parade.

For example, when the overlay_group_status field has a value of “00”,this indicates that an overlay parade is not present in thecorresponding M/H frame. In this case, the receiving system does notneed to analyze field synchronization to obtain overlay parade signalinginformation. When the overlay_group_status field has one of the valuesof “01”, “10”, and “11”, this indicates that an overlay parade ispresent in the M/H frame. Here, let us assume that theoverlay_group_status field in the current M/H frame has a value of “01”.Also, let us assume that the overlay parade configuration has changed ina next M/H frame. In this case, the overlay_group_status field may bechanged to “10” in the next M/H frame.

FIG. 41 illustrates a syntax structure of a TPC data field for signalingdigital broadcast data according to an embodiment of the presentinvention.

The TPC data may include a sub-frame_number field, a slot_number field,a parade_id field, a starting_group_number (SGN) field, anumber_of_groups (NoG) field, a parade_repetition_cycle (PRC) field, anRS_frame_mode field, an RS_code_mode_primary field, anRS_code_mode_secondary field, an SCCC_block_mode field, anSCCC_outer_code_mode_A field, an SCCC_outer_code_mode_B field, anSCCC_outer_code_mode_C field, an SCCC_outer_code_mode_D field, anFIC_version field, a parade_continuity_counter field, a TNoG field and aTPC_protocol_version field.

The Sub-Frame_number field shall be the current Sub-Frame number withinthe Transmission frame, which is transmitted for Transmission framesynchronization. Its value shall range from 0 to 4.

The Slot_number field is the current Slot number within the Sub-Frame,which is transmitted for Transmission frame synchronization. Its valueshall range from 0 to 15.

The Parade_id field identifies the Parade to which this Group belongs.The value of this field may be any 7-bit value. Each Parade in a DATAtransmission shall have a unique Parade_id. Communication of theParade_id between the physical layer and the management layer shall beby means of an Ensemble_id formed by adding one bit to the left of theParade_id. If the Ensemble_id is for the primary Ensemble deliveredthrough this Parade, the added MSB shall be ‘0’. Otherwise, if it is forthe secondary Ensemble, the added MSB shall be ‘1’.

The starting_Group_number (SGN) field shall be the first Slot_number fora Parade to which this Group belongs.

The number_of_Groups (NoG) field shall be the number of Groups in aSub-Frame assigned to the Parade to which this Group belongs, minus 1,e.g., NoG=0 implies that one Group is allocated to this Parade in aSub-Frame.

The Parade_repetition_cycle (PRC) field shall be the cycle time overwhich the Parade is transmitted, minus 1, specified in units ofTransmission frames.

The RS_Frame_mode field represents that one parade transmits one RSframe or two RS frames.

The RS_code_mode_primary field shall be the RS code mode for the primaryRS frame.

The RS_code_mode_secondary field shall be the RS code mode for thesecondary RS frame.

The SCCC_Block_mode field represents how DATA blocks within a group areassigned to SCCC block.

The SCCC_outer_code_mode_A field corresponds to the SCCC outer code modefor Region A within a group.

The SCCC_outer_code_mode_B field corresponds to the SCCC outer code modefor Region B within the group.

The SCCC_outer_code_mode_C field corresponds be the SCCC outer code modefor Region C within the group.

The SCCC_outer_code_mode_D field corresponds to the SCCC outer code modefor Region D within the group.

The FIC_version field represents a version of FIC data.

The Parade_continuity_counter field counter may increase from 0 to 15and then repeat its cycle. This counter shall increment by 1 every(PRC+1) Transmission frames. For example, as shown in Table 12, PRC=011(decimal 3) implies that Parade_continuity_counter increases everyfourth Transmission frame.

The TNoG field may be identical for all sub-frames in an Transmissionframe.

The tpc_protocol_version field is a 5-bit unsigned integer field thatrepresents the version of the structure of the TPC syntax.

TPC data according to the present invention may be extended such that itincludes mobile service data of the E region. In this case, a version ofthe TPC syntax structure indicated by a ‘tpc_protocol_version’ field maybe changed to another version.

TPC data is information for signaling. In the case where the E region isallocated to a transmission area of mobile service data in the group,the TPC data may further include associated information indicating theabove case. One embodiment of the present invention assumes thatscalable mode information is contained in TPC data. That is, scalableinformation indicating an M value from among information of (118+M)mobile service data packets is contained in the TPC data, such that thereception end can receive information about the group structure. Forexample, if the scalable mode is set to ‘000’, M may be ‘11’. If thescalable mode is set to ‘001’, M may be ‘20’. If the scalable mode isset to ‘010’, M may be ‘29’. If the scalable mode is set to ‘011’, M maybe ‘38’. If the scalable mode is set to ‘111’, M may be ‘38’ in allgroups transmitted during 16 slots in a sub frame.

In accordance with still another embodiment of the present invention,scalable mode information contained in TPC data may be classified intoscalable mode information of a current frame and scalable modeinformation of the next frame. That is, TPC data contained in thecurrent frame provides the possibility of estimating data to be receivedin the reception end through the next frame's scalable mode information,such that the receiver acting as the reception end can stably receivedata.

However, the information included in the TPC data presented herein ismerely exemplary. And, since the adding or deleting of informationincluded in the TPC may be easily adjusted and modified by one skilledin the art, the present invention will, therefore, not be limited to theexamples set forth herein. (56)

FIG. 42 is a diagram showing a hierarchical signaling structureaccording to an embodiment of the present invention.

Mobile broadcast technology according to the embodiment of the presentinvention may utilize FIC and SMT signaling methods as shown in FIG. 41.This is called a hierarchical signaling structure in the presentinvention. That is, FIG. 42 shows a hierarchical signaling structure forproviding data necessary for service acquisition through a service maptable (SMT) of an FIC chunk and an IP-level mobile service signalingchannel. As can be seen from FIG. 42, the FIC chunk rapidly delivers amapping relationship between a mobile service and an ensemble to areception system using. That is, the FIC chunk rapidly finds an ensemblefor delivering a service desired by the reception system and providessignaling data for rapidly receiving RS frames of the ensemble to thereception system.

In addition, in the present invention, the ensemble includes a CMMensemble and an SFCMM ensemble. The CMM ensemble is carried through aCMM data group and the SFCMM ensemble is carried through an SFCMM datagroup. The FIC chunk may provide information for enabling a CMMdedicated reception system or receiver to receive only the CMM ensembleand enabling an SFCMM dedicated reception system or receiver to receiveboth the SFCMM ensemble and the CMM ensemble. The SFCMM ensemble mayinclude a conventional SFCMM (or EMM ensemble), an overlay ensemble, anda super ensemble according to parade formats. The ensemble ids of theensembles are shown in the following <table 1>. The formats assigned tothe id types may be changed according to design considerations.

TABLE 1 Ensemble Type parade ensemble_type ensemble_id Conventional P‘000’ 8-bit: ‘0’<parade_id> Ensemble S 8-bit: ‘1’<parade_id> (EMM only)OverlayEnsemble O ‘001’ 8-bit: ‘1111’<overlay_parade_id:4bit> Super P +P ‘001’ 16-bit: ‘0’<parade_id>‘0’ <parade_id> Ensemble P + S 16-bit:‘0’<parade_id>‘1’ <parade_id> S + S 16-bit: ‘1’<parade_id>‘1’<parade_id> P + O ‘101’ 16-bit: ‘0’<parade_id>‘1111’<overlay_parade_id>S + O 16-bit: ‘1’<parade_id>‘1111’<overlay_parade_id> O + O ‘110’16-bit: ‘1111’<overlay parade_id>‘1111’<overlay_parade_id>

FIG. 43 is a diagram showing an embodiment of a syntax structure of anFIC chunk according to the present invention.

A reception system of the present invention enables faster access to acurrently broadcast mobile service using an FIC.

As shown in FIG. 43 A, the syntax of the FIC chunk serves to map amobile service and an ensemble through an FIC. The FIC chunk includes a5-byte FIC chunk header and an FIC chunk payload having a variablelength.

The FIC chunk header may signal a major protocol version change that isnot backward compatible with the FIC chunk, signal a minor protocolversion change that is backward compatible with the FIC chunk, andsignal the respective lengths of extension of the FIC chunk header whichmay be generated by the minor protocol version change, extension of anensemble loop header and extension of a mobile service loop.

FIG. 43 B shows a relationship between the FIC chunk header and the FICchunk payload in case of the minor protocol version change. In theembodiment of the present invention, reception system or receiver whichis able to accept the minor protocol version change processes anextension field, but a legacy reception system or receiver which is notable to accept the minor protocol version change skips the extensionfield using the length information thereof. For example, a receptionsystem which is able to accept the minor protocol version change canidentify the content indicated by the extension field and perform anoperation according to the content indicated by the extension field.

Accordingly, in the present invention, the CMM dedicated receiver mayskip the extension field included in the FIC chunk. The extension fieldis associated with the value of the below-describedFIC_Chunk_header_extension_length field. In addition, the CMM dedicatedreceiver may approximate the size of the FIC chunk using the number ofCMM ensembles and the number of M/H service fields and apply the FICchunk within the CMM receiver. That is, the CMM dedicated receiver maytreat a plurality of SFCMM ensemble loops included in the FIC chunkpayload as FIC chunk stuff bytes. As a result, the CMM dedicatedreceiver may skip the plurality of SFCMM ensemble loops.

FIG. 44 is a block diagram showing an FIC chunk and FIC segmentsaccording to the present invention.

A transmission system according to the present invention segments theFIC chunk into a plurality of FIC segments as shown in FIG. 44 andtransmits the FIC segments to a reception system. The size of each FICsegment unit is 37 bytes and each FIC segment includes a 2-byte FICsegment header and a 35-byte FIC segment payload. That is, as shown inFIG. 44, one FIC chunk including the FIC chunk header and the FIC chunkpayload is segmented into 35 bytes. An FIC segment including thesegmented 35 bytes and the 2-byte FIC segment header may be formed.

In one embodiment of the present invention, the length of the FIC chunkis variable. The length of the FIC chunk may be changed according to thenumber of ensembles carried through a physical transfer channel and thenumber of mobile services included in each ensemble. The FIC chunkpayload may include stuffing data (or stuffing bytes). In this case, thestuffing data is used for alignment between the FIC chunk and a boundaryof a last FIC segment among FIC segments belonging to the FIC chunk. Ifthe length of the stuffing data is minimized, it is possible to reducewaste of FIC segments.

In one embodiment of the present invention, the FIC segments segmentedfrom one FIC chunk may be carried through one subframe or through aplurality of subframes as shown in FIG. 44. If the FIC chunk is carriedusing the latter method, all necessary signaling data can be carriedthrough the FIC chunk even when the amount of data to be carried throughthe FIC chunk is greater than the amount of FIC segments carried throughone subframe (corresponding to the case where a plurality of serviceshaving a very low bit rate is executed).

FIG. 45 is a diagram showing an embodiment of a syntax structure of anFIC segment header according to the present invention.

The FIC segment header may include an FIC_segment_type field, anFIC_Chunk_major_protocol_version field, a Current_next indicator field,an error_indicator field, an FIC_segment_num field, and anFIC_last_segment_num field.

These fields will now be described.

FIC_segment_type—A two-bit field indicating the type of data carried inthis FIC-Segment. When the value of this field is set to ‘00’, thisindicates that the payload of the FIC-Segment is carrying a portion ofan FIC-Chunk. When the value of this field is set to ‘11’, thisindicates that the FIC-Segment is a NULL FIC-Segment that does not haveany meaningful data in its payload. Other values are reserved for futureextension.

FIC_chunk_major_protocol_version—A two-bit field, which indicates themajor protocol version of the FIC-Chunk which is being carried in partthrough the payload of this FIC-Segment. The value of this field isequal to the value of the FIC_chunk_major_protocol_version field of theFIC_chunk_header( ).

current_next_indicator—A one-bit field, which indicates the current/nextstatus of the FIC-Chunk which is being carried in part through thepayload of this FIC-Segment. The value of this field is equal to thevalue of the current_next_indicator field of the FIC_chunk_header( ).

error_indicator—This 1-bit indicator shall indicate whether any errorwas detected in this FIC-Segment. A value of ‘0’ indicates that no errorwas detected. A value of ‘1’ indicates that an error was detected.

FIC_segment_num—A 4-bit unsigned integer field which gives the number ofthis FIC-Segment. For the first FIC-Segment of an FIC-Chunk, the valueof this field is set to 0x0. This field is incremented by one with eachadditional FIC-Segment belonging to an FIC-Chunk.

FIC_last_segment_num—A 4-bit unsigned integer field which gives thenumber of the last FIC-Segment (i.e., the FIC-Segment with the highestFIC_segment_num) of the complete FIC-Chunk.

FIG. 46 is a diagram showing an embodiment of a syntax structure of anFIC chunk header according to the present invention.

In one embodiment of the present invention, the minor protocol versionchange of the FIC chunk is performed by additionally inserting a fieldto an end portion of each of the FIC chunk header, the ensemble loopheader and the mobile service loop in the FIC chunk of the previousminor protocol version. In one embodiment of the present invention, ifthe length of the additional field is not represented by the extensionlength of the FIC chunk header, that is, if a specific field in the FICchunk payload is removed, or if the number of bits assigned to thatfield is changed or the definition of that field is changed, the majorprotocol version of the FIC chunk is updated.

In addition, the FIC chunk header signals information indicating whetherthe data of the FIC chunk payload contains mapping information betweenthe mobile service and the ensemble in a current M/H frame or mappinginformation between a mobile service and an ensemble in the next M/Hframe, and signals the number of ensembles carried through a mobilebroadcast and a transport stream ID of a mobile broadcast through whichthe FIC chunk is currently carried.

The FIC chunk header includes an FIC_chunk_major_protocol_version field,an FIC_chunk_minor_protocol_version field, anFIC_chunk_header_extension_length field, anensemble_loop_header_extension_length field, anM/H_service_loop_extension_length field, a current_next_indicator field,a transport_stream_id field, a num_SFCMM ensemble field and anum_ensembles field.

The FIC_major_protocol_version field is, for example, a two-bit unsignedinteger that represents the major version level of the syntax of the FICChunk. A change in the major version level shall indicate anon-backward-compatible level of change. When this field is updated,legacy receivers who can process the prior major version of theFIC-Chunk protocol shall avoid attempting to process the FIC Chunk.

The FIC_minor_protocol_version field is, for example, a three-bitunsigned integer that represents the minor version level of the syntaxof the FIC-Chunk. A change in the minor version level shall indicate abackward-compatible level of change. If this field is updated, legacyreceivers who can process the same major version of FIC Chunk protocolmay process a part of the FIC Chunk.

The FIC_Chunk_header_extension_length field is a 3-bit unsigned integerthat identifies the length of the FIC-Chunk header extension in bytescaused by the minor protocol version update of the FIC-Chunk, where theextension bytes are appended to the end of the FIC-Chunk header.

The ensemble_header_extension_length field is a 3-bit unsigned integerthat identifies the length of the ensemble header extension in bytescaused by the minor protocol version update of the FIC-Chunk, where theextension bytes are appended to the end of the ensemble loop header.

The M/H_service_loop_extension_length field is a 3-bit unsigned integerthat identifies the length of the ensemble header extension in bytescaused by the minor protocol version update of the M/H service loop,where the extension bytes are appended to the end of the M/H serviceloop.

The current_next_indicator field is a one-bit indicator, which when setto “1” indicates that this FIC-Chunk is currently applicable. When thebit is set to “0”, this indicates that this FIC-Chunk will be applicablefor the next M/H Frame. In the latter case, the most recent version ofFIC-Chunk transmitted with the current_next_indicator bit set to “1” iscurrently applicable. That is, if the value of this field is set to “1”,this indicates that the FIC chunk carries signaling data of a currentM/H frame. If the value of this field is set to “0”, this indicates thatthe FIC chunk carries signaling data of a next M/H frame. In the presentinvention, when generating a reconfiguration in which the mappinginformation between the mobile service and the ensemble in the currentM/H frame and the mapping information between the mobile service and theensemble in the next M/H frame are changed, the M/H frame beforereconfiguration occurs is referred to as a current M/H frame and the M/Hframe in which the reconfiguration occurs is referred to as a next M/Hframe.

The transport_stream_id field is a 16-bit unsigned integer thatrepresents a transport stream ID of a mobile broadcast through which thecurrent FIC chunk is carried. That is, this field serves as a label toidentify this M/H broadcast. The value of this field is equal to thevalue of the transport_stream_id field in the Program Association Table(PAT) in the MPEG-2 transport stream of the main ATSC broadcast.

The num_SFCMM ensembles field is an 8-bit unsigned integer thatrepresents the number of SFCMM ensembles carried through the physicaltransport channel, the value of which equals the number of SFCMMEnsembles carried through this M/H Broadcast that are not available toCMM receiver devices, including the SFCMM Ensembles where the value ofthe PRC for the corresponding M/H Parades is greater than 0 and that donot have any M/H Groups in the M/H Frame to which this FIC-Chunk refers.

The num_ensembles field is an 8-bit unsigned integer that represents thenumber of CMM ensembles carried through the physical transport channel,the value of which shall equal the number of CMM Ensembles carriedthrough the M/H Broadcast, including the M/H Ensembles where the valueof the PRC for the corresponding M/H Parades is greater than 0 and thatdo not have any M/H groups in the M/H Frame to which this FIC-Chunkrefers.

FIG. 47 is a diagram showing an embodiment of a syntax structure of anFIC chunk payload according to the present invention.

In particular, FIG. 47 shows the syntax structure of the FIC chunkpayload in the minor protocol version according to the presentinvention.

The FIC chunk payload includes ensemble configuration information andinformation about the mobile service carried through each ensemble, withrespect to the SFCMM ensembles and the CMM ensembles respectivelycorresponding to the num_SFCMM ensembles field and the num_ensemblesfield in the FIC chunk header of FIG. 46. The FIC chunk payload mayinclude a CMM ensemble loop, a mobile service loop under the CMMensemble loop, an SFCMM ensemble loop, and a mobile service loop underthe SFCMM ensemble loop. Through the FIC chunk payload, the receptionsystem may check through which ensemble a desired mobile service iscarried (by mapping between the ensemble_id and the M/H_service_id) andreceive RS frames belonging to the ensemble. Accordingly, as describedabove, the SFCMM ensemble loop is not allowed in the CMM receiver.

The ensemble loop (or the CMM ensemble loop) and the SFCMM ensemble loopof the FIC chunk payload includes an ensemble_id field, anensemble_protocol_version field, an SLT_ensemble_indicator field, aGAT_ensemble_indicator field, an M/H_service_signaling channel_versionfield, a num_M/H_services field, a mobile service loop, and anFIC_Chunk_stuffing field, all of which are repeated by the value of thenum_ensembles field. The mobile service loop may include amulti_ensemble_service field, an M/H_service_status field, and anSP_indicator field, all of which are repeated by the value of thenum_M/H_services field.

The ensemble_id field is an 8-bit unsigned integer that indicateswhether the ensemble is a CMM ensemble or an SFCMM ensemble, that is,identifies the associated CMM or SFCMM Ensemble. The value of this fieldis derived from the parade_id (carried in the Transmission ParameterChannel, TPC, FIG. 44) of the corresponding CMM or SFCMM Parade, byusing the parade_id of the associated M/H Parade for the leastsignificant 7 bits, and using “0” for the most significant bit when theM/H Ensemble is carried over the Primary RS Frames and using “1” for themost significant bit when the M/H Ensemble is carried over the SecondaryRS Frames. For further details on the TPC, see ATSC A/153 Part 2 [31].The value of ensemble_id of a CMM or SFCMM Ensemble shall not be changedduring the period of time where a CMM or SFCMM Service is present and/orannounced in the SG.

The ensemble_protocol_version field is a 5-bit unsigned integer thatrepresents the version of this ensemble, specifically its RS Framepayload structure and its M/H Service Signaling Channel structure. Thevalue of this field is set as specified below <table 2>.

TABLE 2 Version 0 The M/H ensemble configuration (the RS Frame payloadstructure and the M/H Service Signaling Channel configuration) that isdefined in this version of this standard 1-31 Reserved for other M/Hensemble configurations possibly defined in future versions of thisstandard

A new value of the ensemble_protocol_version would be triggered bychanges to the RS Frame payload structure and/or the M/H ServiceSignaling Channel structure that cannot be signaled by the signalingmechanisms within the RS Frame payload and the M/H Service SignalingChannel. Examples of the general scope of such possible changes include:

A fundamental change in the way data is packed into the RS Framepayload, such as inserting data column by column instead of row by row,or defining an M/H Transport Packet to consist of two rows rather thanone row (to cut TP header overhead in half). A change in the TP(Transport stream) header and perhaps TP packet format, such as adding aTP protocol version field to the TP header, or changing the way stuffingbytes are signaled. A change in the IP address and port used for theService Signaling Channel, perhaps even placing different tables atmultiple different IP addresses or ports. Replacing the currentsignaling tables (SMT, GAT, etc.) with new versions that do not useMPEG-2 private section syntax, but have some totally different structuresuch as XML.

The SLT_ensemble_indicator field is a one-bit indicator that indicateswhether or not SLT information is carried through this ensemble. Thatis, this field, when set to “1”, indicates that the SLT (ServiceLabeling Table) is carried in the M/H Service Signaling Channel of thisEnsemble.

The GAT_ensemble_indicator field is a one-bit indicator indicating thatGAT information is carried within this ensemble. This is, this field,when set to “1”, indicates that the GAT (Guide Access Table) is carriedin the signaling stream of this ensemble.

The M/H_service_configuration_version field is a 5-bit field that is theversion number of the M/H Service Signaling Channel of this M/HEnsemble. The value of this field is modulo 32 and is incremented by 1whenever a change is made in any of the tables carried within the M/HService Signaling Channel in this ensemble.

The num_M/H_services field is an 8-bit unsigned integer that representsthe number of M/H Services carried through this M/H Ensemble.

For example, if the minor protocol version in the FIC chunk header ischanged and the extension field is added to the ensemble loop header,this extension field is added after the num_M/H_services field. Asanother embodiment, if the num_M/H_services field is included in the M/Hservice loop, the extension field added to the ensemble loop header isadded after the M/H_service_configuration_version field.

The M/H_service_id field of the M/H service loop is a 16-bit unsignedinteger that identifies the M/H Service. This integer is unique withinthe M/H Broadcast. When an M/H Service has components in multiple M/HEnsembles, the set of IP streams of the service in each Ensemble istreated as a separate service for signaling purposes, except when theentries for these services in the FIC all have the same M/H_service_idvalue. Thus, the same M/H_service_id value may appear in more than onenum_ensembles loop and when this happens the M/H_service_id shallrepresent the overall combined service, thereby maintaining theuniqueness of the M/H_service_id. For any situation in which a receiverpresents the value of the MH_service_id to a viewer, it is recommendedthat the value of MH_service_id be presented in two parts (the higher 8bits forming the first number and the lower 8 bits forming the lastnumber) separated by an appropriate delimiter.

The multi_ensemble_service field is a two-bit enumerated field thatshall identify whether this M/H Service is carried across more than oneM/H Ensemble. Also, this field identifies whether the M/H Service can berendered meaningfully with only the portion of the M/H Service carriedthrough this M/H Ensemble. The value of this field is defined in thefollowing <table 3>.

TABLE 3 multi_ensemble_service Meaning ‘00’ All the IP streams that formthis M/H Service are delivered through this M/H Ensemble. ‘01’ The IPstreams that form this M/H Service are delivered through multiple M/HEnsembles. A meaningful version of this M/H Service can be rendered onlyusing IP stream components delivered through this M/H Ensemble. ‘10’ TheIP streams that form this M/H Service are delivered through multiple M/HEnsembles. No meaningful version of this M/H Service can be renderedwith only the IP stream components delivered through this M/H Ensemble.‘11’ [Reserved for future ATSC use]

The M/H_service_status field is a 2-bit enumerated field that shallidentify the status of this M/H Service. The most significant bitindicates whether this M/H Service is active (when set to 1) or inactive(when set to 0) and the least significant bit indicates whether this M/HService is hidden (when set to 1) or not (when set to 0).

The SP_indicator field is a 1-bit field indicating that, when set to 1,service protection is applied to at least one of the components neededto provide a meaningful presentation of this M/H Service.

For example, if the minor protocol version in the FIC chunk header ischanged and an extension field is added to the M/H service loop, thisextension is added after the SP_indicator field.

Stuffing may exist in an FIC-Chunk, to keep the boundary of theFIC-Chunk to be aligned with the boundary of the last FIC-Segment amongFIC-segments belong to the FIC chunk. The length of the stuffing isdetermined by how much space is left after parsing the entire FIC-Chunkpayload preceding the stuffing. The number of stuffing bytes is theminimum number needed to make the length of the FIC-Chunk evenlydivisible by 35.

FIG. 48 is a diagram showing another embodiment of a syntax structure ofan FIC segment header, an FIC chunk header and an FIC payload.

FIG. 48 A shows another embodiment of the syntax structure of the FICsegment header according to a major protocol version. If the majorprotocol version is present, the syntax of the FIC segment headerincludes the same fields as the syntax structure of the FIC segmentheader shown in FIG. 45. In this case, theFIC_chunk_major_protocol_version field may be represented by the formatof “01”. This may be changed according to design considerations.

FIG. 48 B shows another embodiment of the syntax structure of the FICchunk header according to a major protocol version. If the majorprotocol version is present, the syntax of the FIC chunk header includesthe same fields as the syntax structure of the FIC chunk header shown inFIG. 46. In this case, the FIC_chunk_major_protocol_version field may berepresented by the format of “01”, the FIC_chunk_minor_protocol_versionfield may be represented by the format of “000”, and theFIC_chunk_header_extension_length field may be represented by the formatof “000”. This may be changed according to design considerations.

FIG. 48 C shows another embodiment of the syntax structure of the FICchunk payload according to a major protocol version. If the majorprotocol version is present, the syntax of the FIC payload may includethe same fields as the syntax structure of the FIC chunk payload shownin FIG. 47, but does not include the CMM ensemble loop.

Accordingly, if the major protocol version is present, the CMM receivermay ignore and skip the SFCMM ensemble and the MH service using the FICinformation.

FIG. 49 shows content indicating that the M/H Service Signaling tablescarried through this M/H Service Signaling Channel are differentiated byutilizing table_id and table_id_extension included in the section headerof each table.

An M/H Service Signaling Channel for ensemble_protocol_version equal to‘00000’ is a single IP multicast stream carried in each M/H Ensemble.The M/H Service Signaling Channel for ensemble_protocol_version equal to‘00000’ shall encapsulate data in UDP datagrams and use the IPdestination address 224.0.23.60 (IANA has assigned this as AtscSvcSig)and destination port 4937/udp (IANA has assigned this to atsc-mh-ssc).

For ensemble_protocol_version equal to ‘00000’, an M/H Service SignalingChannel which is unique to a single M/H Broadcast shall use either aunique source address attributed in the global DNS database to theorganization which provides the M/H Service Signaling Channel or, in thecase of IPv4 datagrams, a source address from the private address range:10.0.0.0-10.255.255.255, 172.16.0.0-172.31.255.255,192.168.0.0-192.168.255.255.

The M/H Service Signaling Channel identified withensemble_protocol_version of ‘00000’ which appears in two or more M/HBroadcasts shall use source addresses attributed in the global DNSdatabase to the organization which provides the Service SignalingChannel.

All the M/H Service Signaling tables, which are listed below, shall onlybe delivered through the M/H Service Signaling Channel, and no other IPdatagrams shall appear in the M/H Service Signaling Channel.

The Service Map Table (SMT-MH)

The Guide Access Table (GAT-MH)

The Cell Information Table (CIT-MH)

The Service Labeling Table (SLT-MH)

The Rating Region Table (RRT)

FIG. 50 is a diagram showing an embodiment of a service map table (SMT)according to the present invention. (FIG. 50 B is a continuous part ofFIG. 50 A) The Service Map Table contains attributes for the M/HServices carried in an M/H Ensemble. Any changes in the contents of theSMT-MH (which would reflect changes in the M/H Service line-up orproperties) are conveyed in a new SMT-MH carrying an incremented versionnumber. The new SMT-MH is inserted into the data stream of the ensembleat the point at which the changes occur. The information contained inthe SMT-MH includes service acquisition information for the IP streamsthat form each M/H Service, such as destination IP address anddestination UDP port number. The set of SMT-MH sections in each ensembleshall include information on all M/H Services that are carried wholly orpartially in that ensemble.

The SMT-MH is carried in ATSC-M/H service signaling sections withtable_id 0xDB, and shall obey the syntax and semantics of the GenericTable Format(GAT) in FIG. 49.

The following constraints are applied to the delivery of the SMT-MH: Foreach Ensemble, SMT-MH sections describing all the services of thatEnsemble are included in that Ensemble at least once every RS Frame. TheSMT-MH sections for each Ensemble are differentiated via the ensemble_idincluded in the section header.

The SMT may include a table_id field, an SMT_MH_protocol_version field,an ensemble_id field, a current_next_indicator field, a num_MH_servicesfield, an MH_service_id field, a multi_ensemble_service field, anMH_service_status field, an SP_indicator field, ashort_MH_service_name_length field, a short_MH_service_name field, anMH_service_category field, a num_components field, an IP_version_flagfield, a service_source_IP_address_flag field, aservice_destination_IP_address_flag field, service_source_IP_addressfield, a service_destination_IP_address field, acomponent_source_IP_address_flag field, an essential_component_indicatorfield, a port_num_count field, component_destination_UDP_port_num field,a component_source_IP_address field, a component_destination_IP_addressfield, a num_component_level_descriptors field, acomponent_level_descriptor( ) field, a num_MH_service_level_descriptorsfield, an MH_service_level_descriptor( ) field, anum_ensemble_level_descriptors field

an ensemble_level_descriptor( ) field. A detailed explanation of thesefields will now be given.

table_id—An 8-bit unsigned integer number that indicates the type oftable section being defined. For the Service Map Table for ATSC-M/H(SMT-MH), the table_id is 0xDB.

SMT_MH_protocol_version—An 8-bit unsigned integer whose function is toallow, in the future, this Service Map Table to carry parameters thatmay be structured differently from those defined in the currentprotocol. At present, the value for the SMT_protocol_version is zero.Non-zero values of SMT_protocol_version may be used by a future versionof this standard to indicate structurally different tables.

ensemble_id—This 8-bit unsigned integer is the Ensemble ID associatedwith this M/H Ensemble. The value of this field shall match theassociated value in the FIC-Chunk.

current_next_indicator—A one-bit indicator, which when set to ‘1’indicates that the Service Map Table sent is currently applicable. Whenthe bit is set to ‘0’, this indicates that the table sent is not yetapplicable and will be the next table to become valid. This standardimposes no requirement that “next” tables (those withcurrent_next_indicator set to ‘0’) must be sent. An update to thecurrently applicable table is signaled by incrementing theversion_number field.

num_MH_services—This 8 bit field shall specify the number of M/HServices in this SMT-MH section.

MH_service_id—A 16-bit unsigned integer that uniquely identifies thisM/H Service within the scope of this MH Broadcast. The MH_service_id ofa service does not change throughout the life of the service. To avoidconfusion, it is recommended that if a service is terminated, then theMH_service_id for the service should not be used for another serviceuntil after a suitable interval of time has elapsed. See Annex A for adescription of an allocation scheme for MH_service_id values.

multi_ensemble_service—A two-bit enumerated field that shall identifywhether the M/H Service is carried across more than one M/H Ensemble.Also, this field shall identify whether or not the M/H Service can berendered only with the portion of M/H Service carried through this M/HEnsemble. The value of this field is defined in Table 6.8.

MH_service_status—A 2-bit enumerated field that shall identify thestatus of this M/H Service. The most significant bit shall indicatewhether this M/H Service is active (when set to 1) or inactive (when setto 0) and the least significant bit shall indicate whether this M/HService is hidden (when set to 1) or not (when set to 0). Hiddenservices are normally used for proprietary applications, and ordinaryreceiving devices should ignore them.

SP_indicator—A 1-bit field that shall indicate, when set, that serviceprotection is applied to at least one of the components needed toprovide a meaningful presentation of this M/H Service.

short_MH_service_name_length—A three-bit unsigned integer that shallindicate the number of byte pairs in the short_service_name field. Thisvalue is shown as ‘m’ in the No. of Bits column for theshort_service_name field. When there is no short name for this M/Hservice, the value of this field is O.

short_MH_service_name—The short name of the M/H Service, each characterof which is encoded per UTF-8 [29]. When there are an odd number ofbytes in the short name, the second byte of the last of the byte pairper the pair count indicated by the short_service_name_length fieldshall contain 0x00.

MH_service_category—A 6-bit enumerated type field that shall identifythe type category of service carried in this M/H Service as defined inthe table below. When the value of this field is set to the value whichis indicated “Informative only”, the value of this field is treated asan informative description to the category of service, and the receiveris required to examine the component_level_descriptors( ) of the SMT-MHto identify the actual category of service carried through this M/HService. Services that have a video and/or audio component will includean NTP timebase component.

TABLE 4 MH_service_category Meaning 0x00 The service category is notspecified by the MH_service_category field. Look in thecomponent_level_descriptor( ) to identify the category of service. 0x01Basic TV (Informative only) - Look in the component_level_descriptor( )to identify the specific category of service. 0x02 Basic Radio(Informative only) - Look in the component_level_descriptor( ) toidentify the specific category of service. 0x03 RI service - RightsIssuer service as defined in Part #6 [34] of this standard. 0x04 Notspecified by the current version of this standard. 0x05 Not specified bythe current version of this standard. 0x06 Not specified by the currentversion of this standard. 0x07 Not specified by the current version ofthis standard. 0x08 Service Guide - Service Guide (Announcement) asdefined in Part 4 [46] of this standard. 0x09 Not specified by thecurrent version of this standard. 0x0A Not specified by the currentversion of this standard. 0x0B~0xFF Reserved for future use.

num_components—This 5-bit field specifies the number of IP streamcomponents in this M/H Service.

IP_version_flag—A 1-bit indicator, which when set to ‘0’ shall indicatethat service_source_IP_address, service_destination_IP_addresscomponent_destination_IP_address and component_source_IP_address fieldsare IPv4 addresses. The value of ‘1’ for this field is reserved forpossible future indication that service_source_IP_address,service_destination_IP_address component_destination_IP_address andcomponent_source_IP_address fields are for IPv6. Use of IPv6 addressingis not currently defined.

service_source_IP_address_flag—A 1-bit Boolean flag that shall indicate,when set to ‘1’, that a Service source IP address value for this M/HService is present.

service_destination_IP_address_flag—A 1-bit Boolean flag that indicates,when set to ‘1’, that a service_destination_IP_address value is present,to serve as the default IP address for the components of this M/HService.

service_source_IP_address—This field is present if theservice_source_IP_address_flag is set to ‘1’ and shall not be present ifthe service_source_IP_address_flag is set to ‘0’. If present, this fieldshall contain the source IP address of all the IP datagrams carrying thecomponents of this M/H Service, except for the IP datagrams of anycomponents where a component_source_IP_address field is present. Theconditional use of the 128 bit-long address version of this field servesto facilitate possible use of IPv6 in the future, although use of IPv6is not currently defined.

service_destination_IP_address—This field is present if theservice_destination_IP_address_flag is set to ‘1’ and shall not bepresent if the service_destination_IP_address_flag is set to ‘0’. Ifthis service_destination_IP_address is not present, then thecomponent_destination_IP_address field is present for each component inthe num_components loop. The conditional use of the 128 bit-long addressversion of this field facilitates possible use of IPv6 in the future,although use of IPv6 is not currently defined.

component_source_IP_address_flag—A 1-bit Boolean flag that shallindicate, when set to ‘1’, that the component_source_IP_address ispresent for this component.

essential_component_indicator—A one-bit indicator which, when set to‘1’, indicates that this component is an essential component for the M/HService. Otherwise, this field indicates that this component is anoptional component.

component_destination_IP_address_flag—A 1-bit Boolean flag thatindicates, when set to ‘1’, that the component_destination_IP_address ispresent for this component.

port_num_count—This field shall indicate the number of destination UDPports associated with this UDP/IP stream component. Values ofport_num_count greater than one are intended only for components thatrequire multiple UDP/IP streams. Each stream of such a component isassigned a base destination port number. The values of the basedestination port numbers shall start from thecomponent_destination_UDP_port_num field and shall be assignedsequentially, taking into account that some streams imply usage of morethan one UDP port. For example, an RTP stream would cause an incrementby two, to allow for the RTCP stream associated with that RTP stream.

component_destination_UDP_port_num—A 16-bit unsigned integer, whichrepresents the destination UDP port number for this UDP/IP streamcomponent. For RTP streams, the value ofcomponent_destination_UDP_port_num is even, and the next higher valueshall represent the destination UDP port number of the associated RTCPstream.

component_source_IP_address—This field is present if thecomponent_source_IP_address_flag is set to ‘1’ and shall not be presentif the component_source_IP_address_flag is set to ‘0’. When this fieldis present, the source address of the IP datagrams carrying thiscomponent of the MH Service shall match the address in this field. Note:The conditional use of the 128 bit-long address version of this fieldfacilitates possible use of IPv6 in the future, although use of IPv6 isnot currently defined.

component_destination_IP_address—This field is present if thecomponent_destination_IP_address_flag is set to ‘1’ and shall not bepresent if the component_destination_IP_address_flag is set to ‘0’. Whenthis field is present, the destination address of the IP datagramscarrying this component of the MH Service shall match the address inthis field. When this field is not present, the destination address ofthe IP datagrams carrying this component shall match the address in theMH_service_destination_IP_address field. The conditional use of the 128bit-long address version of this field facilitates possible use of IPv6in the future, although use of IPv6 is not currently defined.

num_component_level_descriptors—This 4 bit field specifies the number ofcomponent level descriptors for this component.

component_level_descriptor( )—One or more descriptors providingadditional information for this IP stream component may be included.

num_MH_service_level_descriptors—This 4 bit field specifies the numberof service level descriptors for this service.

MH_service_level_descriptor( )—Zero or more descriptors providingadditional information for this M/H Service may be included.

num_ensemble_level_descriptors—This 4 bit field specifies the number ofensemble level descriptors for this ensemble.

ensemble_level_descriptor( )—Zero or more descriptors providingadditional information for the M/H Ensemble which this SMT-MH describesmay be included.

FIG. 51 is a diagram showing another embodiment of a service map table(SMT) according to the present invention.

The SMT shown in FIG. 51 may include the same fields as the fieldsincluded in the SMT shown in FIG. 50. The SMT may further include anensemble_id_MSB field, an ensemble_id_type field and an ensemble_id_typeloop, if the SFCMM ensemble is an overlay ensemble or a super ensemble.The ensemble_id_MSB field is an identifier indicating whether or not amost significant bit assigned to the ensemble id is changed, and theensemble_id_type field is an identifier indicating whether the currentlycarried SFCMM ensemble is an SFCMM ensemble, an overlay ensemble or asuper ensemble. The ensemble_id_type loop may include an ensemble_id_LSBfield. The ensemble_id_LSB field is an identifier indicating whether ornot a least significant bit assigned to the ensemble_id is changedwhenever the bit number of the ensemble id type is increased.

FIG. 52 is a diagram showing an embodiment of a cell information table(CIT) according to the present invention. (FIG. 52 B is a continuouspart of FIG. 52 A)

The optional Cell Information Table for ATSC-M/H (CIT-MH), when present,provides carrier frequency information on selected transmitters inadjacent cells that are transmitting services which are the same as, orvery similar to, services in the M/H Broadcast where the CIT appears.The purpose of this table is to allow a viewer to continue watching thesame service, Or a very similar service, when traveling between M/Htransmitter coverage areas. This table only applies to a Multi-FrequencyNetwork environment, and is deprecated for a Single Frequency Networkenvironment. There are no constraints on the repetition rate of theCIT-MH sections.

The CIT shown in FIG. 52 may include a table_id field, aCIT_MH_protocol_version field, an ensemble_id field, anum_home_cell_transmitters field, a Transmitter_latitude field, aTransmitter_longitude field, a transmitter_AERP field, atransmitter_relative_pattern_depth field, a transmitter_null_positionsfield, a num_MH_services field, an MH_service_id field, a num_cellsfield, a transport_stream_id field, a PTC_num field, a cell_ensemble_idfield and a cell_MH_service_id field. A detailed explanation of thesefields will now be given.

table_id—An 8-bit unsigned integer that indicates the type of tablesection being defined. For the Cell Information Table for ATSC-M/H(CIT-MH), the table_id is 0xDD.

CIT_MH_protocol_version—An 8-bit unsigned integer whose function is toallow, in the future, this Cell Information Table to carry parametersthat may be structured differently from those defined in the currentprotocol. At present, the value of CIT_protocol_version is zero.Non-zero values of CIT_protocol_version may be used by a future versionof this standard to indicate structurally different tables.

ensemble_id—This 8-bit unsigned integer is the Ensemble ID associatedwith this M/H Ensemble. The value of this field shall match theassociated value in the FIC-Chunk. See Table 6.5.

num_home_cell_transmitters—An 8-bit unsigned integer that shall give thenumber of transmitters in the home cell whose location is to beannounced.

Transmitter_latitude—latitude of this home cell transmitter, inten-thousandths of a degree, with positive and negative latitude valuesconforming to standard conventions.

Transmitter_longitude—longitude of this home cell transmitter, inten-thousandths of a degree, with positive and negative longitudeconforming to standard conventions.

transmitter_AERP—Effective radiated power in dB, adjusted for height ofantenna center of radiation.

transmitter_relative_pattern_depth—Depth of the largest null in theantenna azimuth pattern in multiples of 8 dB, rounded down to the nextlowest multiplier value. Any value greater than 24 dB is rounded down to24 dB. A value of ‘00’ may mean no data is available.

transmitter_null_positions—Ordinal direction(s) where the antennaazimuth pattern is 8 dB or more below the peak AERP, as indicated byzeroes in corresponding bit positions. The Northern sector isrepresented by the MSB; each succeeding bit shall proceed clockwisearound the compass with NE represented by the next most significant bit,and continuing until reaching NW, which is represented by the LSB. Avalue of ‘1111 1111’ may mean no data is available.

num_MH_services—This 8 bit field shall specify the number of M/HServices in this CIT-MH section.

MH_service_id—A 16-bit unsigned integer that shall identify an M/HService.

num_cells—This 8 bit field shall specify the number of adjacenttransmitters, which transmit an MH service the same as, or very similarto, the service identified by MH_service_id.

transport_stream_id—A 16-bit unsigned integer in the range of 0x0000 to0xFFFF that shall identify an M/H Broadcast carrying an M/H servicewhich to be considered the same as, or very similar to, the serviceidentified by MH_service_id.

PTC_num—This 8-bit unsigned integer shall represent the physicaltransmission channel where the M/H Broadcast represented by thetransport_stream_id is transmitted, where the mapping from integervalues to frequency bands is given by 47CFR73.603 [6].

cell_ensemble_id—This 8-bit unsigned integer is the Ensemble IDassociated with the M/H Ensemble which carries the M/H Serviceidentified by the cell_MH_service_id below.

cell_MH_service_id—A 16-bit unsigned integer that shall identify the M/HService in the M/H Broadcast identified by the transport_stream_id abovethat is to be considered the same as, or very similar to, the M/HService identified by the MH_service_id covering this num_cells loop.

FIG. 53 is a diagram showing another embodiment of a cell informationtable (CIT) according to the present invention.

The CIT shown in FIG. 53 may include the same fields as the CIT shown inFIG. 52. The CIT may further include an ensemble_id_MSB field, anensemble_id_type field and an ensemble_id_type loop, if the SFCMMensemble is an overlay ensemble or a super ensemble. The ensemble_id_MSBfield is an identifier indicating whether or not a most significant bitassigned to the ensemble id is changed, and the ensemble_id_type fieldis an identifier indicating whether the currently carried SFCMM ensembleis an SFCMM ensemble, an overlay ensemble or a super ensemble. Theensemble_id_type loop may include an ensemble_id_LSB field. Theensemble_id_LSB field is an identifier indicating whether or not a leastsignificant bit assigned to the ensemble_id is changed whenever the bitnumber of the ensemble id type is increased.

FIG. 54 is a diagram showing an embodiment of a service label table(SLT) according to the present invention.

If an M/H receiver finds itself in a new geographical area, with noaccess to SG data, it could perform a very fast frequency scan, lookingat only the FIC for each M/H Broadcast it finds, and display to the usera list of available content channels. However, the only information foreach content channel in this list would be the MH_service_id.

An M/H receiver in such a situation could also perform a much slowerfrequency scan, looking at the SMT-MH sections in every M/H Ensemble ofevery M/H Broadcast it finds, and display to the user a more informativelist containing the name and service type of each service, as well asthe MH_service_id, and perhaps even the title of the current program ineach service.

The optional Service Labeling Table for ATSC-M/H (SLT-MH) is designed toprovide a middle ground, whereby such a receiver can perform arelatively fast content channel scan, looking only at the ensemble thatcarries the SLT-MH in each M/H Broadcast it finds (as signaled in theFIC), and then present a list of the available content channels with thebrief name and service type of each content channel, as well as theservice ID.

The following constraints apply to the broadcast of the SLT-MH:

SLT-MH sections, if present, are delivered through the M/H ServiceSignaling Channel of the M/H Ensemble for which theSLT_ensemble_indicator of the FIC-Chunk is set to ‘1’. If present, theSLT-MH sections are delivered at least once per M/H Frame.

The SLT may include a table_id field, an SLT_MH_protocol_version field,a current_next_indicator field, a num_MH_services field, anMH_service_category field, an MH_service_id field, ashort_MH_service_name_length field, a short_MH_service_name field, anum_descriptors field and an MH_service_descriptor( ) field.

These fields will now be described in detail.

table_id—An 8-bit unsigned integer that indicates the type of tablesection being defined. For the Service Labeling Table for ATSC-M/H(SLT-MH), the table_id is 0xDE.

SLT_MH_protocol_version—An 8-bit unsigned integer whose function is toallow, in the future, this Service Labeling Table to carry parametersthat may be structured differently than those defined in the currentprotocol. At present, the value of SLT_protocol_version is zero.Non-zero values of SLT_protocol_version may be used by a future versionof this standard to indicate structurally different tables.

current_next_indicator—A one-bit indicator, which when set to ‘1’ shallindicate that the sent Service Labeling Table is currently applicable.When the bit is set to ‘0’, this indicates that the table sent is notyet applicable and is instead the next table to become valid. Thisstandard imposes no requirement that “next” tables (those withcurrent_next_indicator set to ‘0’) must be sent. An update to thecurrently applicable table is signaled by incrementing the versionnumber field.

num_MH_services—This 8 bit field shall specify the number of M/HServices in this SLT-MH section.

MH_service_category—A 6-bit enumerated type field that shall identifythe type of service carried in this M/H Service as defined in Table 7.3.

MH_service_id—A 16-bit unsigned integer that shall identify an M/HService in this M/H Broadcast.

short_MH_service_name_length—A three-bit unsigned integer that shallindicate the number of byte pairs in the short_service_name field. Thisvalue is shown as ‘m’ in the No. of Bits column for theshort_service_name field. When there is no short name for this M/Hservice, the value of this field shall be 0.

short_MH_service_name—The short name of the M/H Service, each characterof which is encoded per UTF-8 [29]. When there are an odd number ofbytes in the short name, the second byte of the last of the byte pairper the pair count indicated by the short_service_name_length fieldshall contain 0x00. This name shall match the short name for this M/HService that appears in the SMT-MH.

num_descriptors—A 4-bit unsigned integer specifying the number ofdescriptors in the following descriptor loop.

MH_service_descriptor( )—A descriptor providing information about the MHservice.

FIG. 55 is a block diagram showing an embodiment of a digital broadcastreceiver according to the present invention.

The digital broadcast receiver may include an ATSC-M/H Basebandprocessor 2100, an ATSC-MH service demultiplexer 2300, an ATSC-MH IPadaptation module 2500, a common IP module 2700 and an applicationmodule 2900. The digital broadcast receiver may further include anoperation controller 2960, an EPG manager 2970, an application manager2980, a presentation manager 2990 and an UI manager 2996.

The ATSC-M/H Baseband processor 2100 includes a Baseband OperationController 2110, a tuner 2120, a demodulator 2130, an equalizer 2140, aknown sequence detector 2150, a block decoder 2160, a baseband signalingdecoder 2170, a primary RS frame decoder 2180, and a secondary RS framedecoder 2190.

The Baseband Operation Controller 2110 controls the overall operation ofthe baseband module of the receiver. All the components of the ATSC-M/HBaseband processor 2100 are controlled by the Baseband OperationController 2110.

The tuner 2120 tunes the receiver in order to receive a digitalbroadcast signal of a specific frequency. The tuner 2120 down-convertsthe frequency of the received signal into an Intermediate Frequency (IF)signal and outputs the IF signal to the demodulator 2130 and the knownsequence detector 2150.

The demodulator 2130 performs automatic gain control, carrierrestoration, timing restoration and the like with respect to the digitalIF signal of the passing band received from the tuner 2120 so as to forma baseband signal and outputs the baseband signal to the equalizer 2140and the known sequence detector 2150. The demodulator 2130 may use thesymbol streams of the known data received from the known sequencedetector 2150 upon timing restoration or carrier restoration. That is,the demodulator 2130 demodulates broadcast data using the result ofdemodulating the known data of the receiver so as to increasedemodulation performance.

The equalizer 2140 receives the signal demodulated by the demodulator2130, compensates for channel distortion generated during thetransmission process, and outputs the signal to the block decoder 2160.The equalizer 2140 can improve equalization performance using the knowndata symbol streams received from the known sequence detector 2150. Inaddition, the equalizer can improve equalization performance throughfeedback of the decoding result of the block decoder 2160.

The known sequence detector 2150 receives input/output data of thedemodulator 2130, that is, data before demodulation is performed orpartially demodulated data, and detects the location of the known datainserted by the transmitter. The known sequence detector 2150 outputsthe detected location information of the known data and the known datasequence decoded at that location to the demodulator 2130 and theequalizer 2140. In addition, the known sequence detector 2150 may outputto the block decoder 2160 information for enabling the block decoder2160 to identify mobile service data subjected to additional encoding atthe transmitter and main service data which is not subjected toadditional encoding.

The block decoder 2160 performs trellis decoding and block decoding ifthe data (i.e., signaling data or data in the RS frame) input afterchannel equalization is performed by the equalizer 2140 has beensubjected to both block encoding and trellis encoding, and performs onlytrellis decoding if the data (i.e., main service data) has beensubjected to trellis encoding alone.

The baseband signaling decoder 2170 performs decoding with respect tothe signaling data subjected to both block encoding and trellis encodingafter channel equalization is performed by the equalizer 2140. At thistime, the decoded signaling data includes a transmission parameter. Inthe embodiment of the present invention, such signaling data may beTransmission Parameter Channel (TPC) data. The transmission parameterincluded in the signaling data may include information indicatingwhether the TPC data is changed, that is, updated, informationindicating whether the transmitted digital broadcast signal istransmitted through an SFCMM or a CMM, information indicating the numberof mobile service data packets of the SFCMM additionally included in onedata group, information indicating whether a data block included in eachof neighboring data groups forms one SCCC block, and the like.

The primary RS frame decoder 2180 receives the output of the blockdecoder 2160 and receives only mobile service data subjected to RSencoding and/or CRC encoding. The primary RS frame decoder 2180 performsthe inverse process of the RS frame encoder of the transmission system.In addition, the primary RS frame decoder corrects errors in the RSframe and collects a plurality of error-corrected data groups so as toform one RS frame. That is, the primary RS frame decoder 2180 decodesthe primary RS frame including data for an actual broadcast service.

The secondary RS frame decoder 2190 receives the output of the blockdecoder 2160 and receives only the mobile service data subjected to RSencoding and/or CRC encoding. The secondary RS frame decoder 2190performs the inverse process of the RS frame encoder of the transmissionsystem. In addition, the secondary RS frame decoder corrects errors inthe RS frame and collects a plurality of error-corrected data groups soas to form one RS frame. The secondary RS frame decoder 2190 decode thesecondary RS frame including secondary data for a broadcast service.Although the primary RS frame decoder 2180 and the secondary RS framedecoder 2190 are illustrated as being separate, the primary RS framedecoder 2180 and the secondary RS frame decoder 2190 may be included inthe RS frame decoder and respectively perform primary RS frame decodingor secondary RS frame decoding.

The ATSC-MH service demultiplexer 2300 includes an FIC segment buffer2310, an FIC segment parser 2320, an FIC chunk parser 2330, an M/Hservice signaling section parser 2340, an M/H service signaling sectionbuffer 2350, a service manager 2360 and a service map/guide DB 2370.

The FIC segment buffer 2310 buffers the FIC-segment group in the M/Hsubframe subjected to deinterleaving and RS decoding, which is receivedfrom the baseband signaling decoder 2170.

The FIC segment parser 2320 extracts, parses and processes the header ofthe FIC segment stored in the FIC segment buffer 2310. Through the valuethe FIC_chunk_major_protocol_version or theFIC_chunk_minor_protocol_version included in the header of the FICgenerated in this process, the CMM receiver ignores the field associatedwith the SFCMM. Through the value of theFIC_chunk_header_extension_length included in the header of the FIC, theCMM receiver skips the added field in the header.

The FIC chunk parser 2330 restores and parses/processes the FIG chunkdata structure in the FIC segments parsed by the FIC Segment Parser2320.

The M/H service signaling section parser 2340 parses/processes the tablesections of the M/H service signaling channel transmitted through theUDP/IP stream.

The M/H service signaling section buffer 2350 buffers the table sectionsof the M/H service signaling channel processed by the M/H servicesignaling section parser 2340.

The service manager 2360 configures a service map through the signalingdata collected by the FIC Chunk Parser 2330 and the M/H ServiceSignaling Section Parser 2340, and creates a program guide using aservice guide. In addition, the service manager controls the BasebandOperation Controller 2110 so as to receive a desired M/H serviceaccording to user input and controls the program guide to be displayedaccording to user input.

The service map/guide DB 2370 stores the service map and the serviceguide created by the service manager 2360, and extracts and deliversdata associated with a service necessary for each unit according toinputs of the service manager 2360 and the EPG manager 2970.

The ATSC-MH IP adaptation module 2500 includes a primary RS frame buffer2510, a secondary RS frame buffer 2520, an M/H TP (Transport streamPacket) buffer 2530 and an M/H TP parser 2540.

The primary RS frame buffer 2510 buffers the RS frame received from theprimary RS frame decoder 2180 and delivers the RS frame to the M/H TPbuffer 2530 in units of frame rows.

The secondary RS frame buffer 2520 buffers the RS frame received fromthe secondary RS frame decoder and delivers the RS frame to the M/H TPbuffer 2530 in units of frame rows. The primary RS frame buffer 2510 andthe secondary RS frame buffer 2520 may be physically composed of onebuffer.

The M/H TP buffer 2530 extracts and buffers the M/H TP corresponding toeach row of the RS frame.

The M/H TP parser 2540 parses the first 2-byte header of the M/H TP andrestores an IP Datagram.

The common IP module 2700 includes an IP datagram buffer 2710, an IPdatagram header parser 2713, a descrambler 2720, a UDP datagram buffer2730, a UDP datagram parser 2733, an RTP/RTCP datagram buffer 2740, anRTP/RTCP datagram parser 2743, an NTP datagram buffer 2750, an NTPdatagram parser 2753, a SvcProtection stream buffer 2760, aSvcProtection stream handler 2763, an ALV/LCT stream buffer 2770, anALV/LCT stream parser 2773, a decompressor 2780, a key storage 2783, anXML parser 2785 and an FDT handler 2787.

The IP datagram buffer 2710 buffers the IP datagrams encapsulated andtransmitted through the M/H TP.

The IP datagram header parser 2713 restores the IP datagrams and parsesthe header of each datagram. The operation of the IP datagram headerparser 2713 is performed by the service manager 2360.

The descrambler 2720 descrambles the data of a scrambled payload of thereceived IP datagrams using an encryption key received from theSvcProtection Stream Handler 2763.

The UDP datagram buffer 2730 buffers UDP datagrams transmitted throughthe IP Datagram.

The UDP datagram parser 2733 restores the UDP datagrams and parses andprocesses the restored UDP Header.

The RTP/RTCP datagram buffer 2740 buffers datagrams of RTP/RTCP streamtransmitted through the UDP/IP Stream.

The RTP/RTCP datagram parser 2743 restores, parses and processes thedatagrams of the RTP/RTCP stream.

The NTP datagram buffer 2750 buffers the datagrams of the network timeprotocol stream transmitted through the UDP/IP stream.

The NTP datagram, parser 2753 restores, parses and processes thedatagrams of the network time protocol stream.

The SvcProtection stream buffer 2760 buffers data such as a key valuefor descrambling necessary for a service protection function transmittedthrough the UDP/IP Stream.

The SvcProtection stream handler 2763 processes the data such as the keyvalue for descrambling necessary for the service protection function.The output of this module is delivered to the descrambler 2720.

The ALV/LCT stream buffer 2770 buffers ALC/LCT data transmitted throughthe UDP/IP stream.

The ALV/LCT stream parser 2773 restores ALC/LCT data transmitted throughthe UDP/IP, and parses the header and the header extension of theALC/LCT.

The decompressor 2780 performs a decompression process if thetransmitted file is compressed.

The key storage 2783 stores a key message used for the serviceprotection function restored by the SvcProtection stream handler.

The XML parser 2785 parses an XML document transmitted through ALC/LCTsession, and delivers the parsed data to appropriate modules such as theFDT handler 2787 and the SG handler 2950.

The FDT handler 2787 parses and processes a file description table of aFLUTE protocol transmitted through an ALC/LCT session.

The application module 2900 includes an A/V decoder 2910, a file decoder2920, a file storage 2930, an M/W engine 2940 and an SG (Service Guide)handler 2950.

The A/V decoder 2910 decodes the audio/video data received through theRTP/RTCP datagram parser 2743 for presentation to the user.

The file decoder 2920 decodes the file restored by, the ALV/LCT streamparser 2773.

The file storage 2930 stores the file decoded by the file decoder 2920and, if necessary, provides the file to another module.

The M/W engine 2940 processes data such as the file transmitted throughthe FLUTE Session and delivers the data to the presentation manager2990.

The SG (Service Guide) handler 2950 collects and parses the serviceguide data transmitted in XML format and delivers the service guide datato the EPG manager 2970.

The operation controller 2960 processes the command of the user receivedthrough the UI Manager 2996 and controls the manager of the modulenecessary for processing the command to perform an action.

The EPG manager 2970 manages the display of the EPG according to userinput using EPG data transmitted through the service guide handler 2950.

The application manager 2980 manages the processing of application datatransmitted in the form of an object, a file, etc.

The presentation manager 2990 processes the data received from the A/Vdecoder 2910, the M/W engine 2940 and the EPG manager 2950 in order topresent the service to the user. Such a process may be performed underthe control of the operation controller 2960.

The UI manager 2996 delivers user input to the operation controller 2960through the user interface and manages the start of the process of aservice requested by the user.

The names of the units of the above-described receiver may be changed.In addition, specific modules may be omitted or added in a certainsystem.

FIG. 56 is a flowchart illustrating an embodiment of a transmissionsystem of the present invention.

The encoder 103 encodes mobile data for forward error correction (FEC)to build Reed-Solomon (RS) frames and divides the RS frames into RSframe portions (S5600).

The block processor 104 divides the RS frame portions into SeriallyConcatenated Convolutional Code (SCCC) blocks and maps the SCCC blocksto data blocks and scalable data blocks, corresponding to a plurality ofdata segments (S5610). In this case, at least one of the SCCC blocksincludes one of the data blocks and one of the scalable blocks.

The signaling encoder 105 encodes signaling data including a header anda payload (S5620).

The group formatter 106 forms data groups including the data blocks andthe scalable blocks, wherein specific data blocks of the data blocks inthe data groups include the signaling data having information about anumber of ensembles representing a collection of services transmittedthrough the data groups (S5630).

The interleaver 112 interleaves data in the data groups, wherein theinterleaved data includes a plurality of data segments, and wherein atleast one of the plurality of data segments includes a part of one ofthe data blocks and a part of one of the scalable data blocks (S5640).

The transmission unit 119 transmits the interleaved data during slots ina transmission frame (S5650).

FIG. 57 is a flowchart illustrating an embodiment of a reception systemof the present invention.

The tuner 2120 receives a broadcast signal including a transmissionframe (S5700), wherein a parade of data groups in the broadcast signalis received during slots within the transmission frame, each data groupincluding data blocks and scalable blocks, corresponding to a pluralityof data segments, wherein at least one of the plurality of data segmentsincludes a part of one of the data blocks and a part of one of thescalable data blocks, wherein specific data blocks of the data blocks inthe data groups include the signaling data having information about anumber of ensembles representing a collection of services transmittedthrough each data group, wherein each data group includes signaling datasegments having a segment payload.

The demodulator 2130 demodulates the broadcast signal and obtains thesignaling data segments in each data group (S5710).

The baseband signaling decoder 2170 decodes the signaling data in thesignaling data segments (S5720).

FIG. 58 is a block diagram illustrating a receiving system according toan embodiment of the present invention.

The receiving system of FIG. 58 includes an antenna 1300, a tuner 1301,a demodulating unit 1302, a demultiplexer 1303, a program table buffer1304, a program table decoder 1305, a program table storage unit 1306, adata handler 1307, a middleware engine 1308, an A/V decoder 1309, an A/Vpost-processor 1310, an application manager 1311, and a user interface1314. The application manager 1311 may include a channel manager 1312and a service manager 1313.

In FIG. 58, solid lines indicate data flows and dotted lines indicatecontrol flows.

The tuner 1301 tunes to a frequency of a specific channel through any ofan antenna, a cable, or a satellite and down-converts the frequency toan Intermediate Frequency (IF) signal and outputs the IF signal to thedemodulating unit 1302.

In one embodiment of the present invention, the tuner 1301 may select afrequency of a specific mobile broadcasting channel from amongbroadcasting channels transmitted via the antenna 1300. For example, ifit is assumed that the receiving system is a terminal having both acommunication function such as a phone function and a broadcast functionsuch as a mobile broadcasting function, the antenna 1300 may be used asa broadcasting antenna, and an additional communication antenna may alsobe included in the receiving system. That is, the broadcasting antennamay be physically different than the communication antenna. For anotherexample, one antenna may be used as both the broadcasting antenna andthe communication antenna. For still another example, a plurality ofantennas having different polarization characteristics may be used as asubstitute for the broadcasting antenna, so that a multi-path diversityscheme is made available. In this case, although a quality of a receivedbroadcast signal increases in proportion to the number of used antennas,power consumption excessively increases and the size of a space occupiedby an overall system also increases. Therefore, it is preferable that aproper number of diversity antennas be used in consideration of theabove-mentioned limitations.

Herein, the tuner 1301 is controlled by the channel manager 1312 in theapplication manager 1311 and reports the result and strength of abroadcast signal of the tuned channel to the channel manager 1312. Datareceived through the frequency of the specific channel includes mainservice data, mobile service data, a transmission parameter, and programtable information for decoding the main service data and the mobileservice data.

The demodulating unit 1302 performs VSB demodulation, channelequalization, etc., on the signal output from the tuner 1301 andidentifies and separately outputs main service data and mobile servicedata. The demodulating unit 1302 will be described in detail in a later.

On the other hand, the transmitter can transmit signaling information(or TPC information) including transmission parameters by inserting thesignaling information into at least one of a field synchronizationregion, a known data region, and a mobile service data region.Accordingly, the demodulating unit 1302 can extract the transmissionparameters from the field synchronization region, the known data region,and the mobile service data region.

The transmission parameters may include M/H frame information, sub-frameinformation, slot information, parade-related information (for example,a parade_id, a parade repeat period, etc.), information of data groupsin a sub-frame, RS frame mode information, RS code mode information,SCCC block mode information, SCCC outer code mode information, FICversion information, etc.

The demodulating unit 1302 performs block decoding, RS frame decoding,etc., using the extracted transmission parameters. For example, thedemodulating unit 1302 performs block decoding of each region in a datagroup with reference to SCCC-related information (for example, SCCCblock mode information or an SCCC outer code mode) included in thetransmission parameters and performs RS frame decoding of each regionincluded in the data group with reference to RS-related information (forexample, an RS code mode).

In the embodiment of the present invention, an RS frame including mobileservice data demodulated by the demodulating unit 1302 is input to thedemultiplexer 1303.

That is, data inputted to the demultiplexer 1303 has an RS frame payloadformat. More specifically, the RS frame decoder of the demodulating unit1302 performs the reverse of the encoding process performed at the RSframe encoder of the transmission system to correct errors in the RSframe and then outputs the error-corrected RS frame payload to a dataderandomizer. The data derandomizer then performs derandomizing on theerror-corrected RS frame payload through the reverse of the randomizingprocess performed at the transmission system to obtain an RS framepayload.

The demultiplexer 1303 may, receive RS frame payloads of all parades andmay also receive only an RS frame payload of a parade including a mobileservice that the user desires to receive through power supply control.For example, when RS frame payloads of all parades are received, thedemultiplexer 1303 can demultiplex a parade including a mobile servicethat the user desires to receive using a parade_id.

When one parade carries two RS frames, the demultiplexer 1303 needs toidentify an RS frame carrying an ensemble including mobile service datato be decoded from a parade containing a mobile service that the userdesires to receive. That is, when a received single parade or a paradedemultiplexed from a plurality of parades carries a primary ensemble anda secondary ensemble, the demultiplexer 1303 selects one of the primaryand secondary ensembles.

In an embodiment, the demultiplexer 1303 can demultiplex an RS framecarrying an ensemble including mobile service data to be decoded usingan ensemble_id created by adding one bit to a left position of theparade_id.

The demultiplexer 1303 refers to the header of the mobile service datapacket within the RS frame payload belonging to the ensemble includingthe mobile service data that are to be decoded, thereby identifying whenthe corresponding mobile service data packet is the signaling tableinformation or the IP datagram of the mobile service data.Alternatively, when the signaling table information and the mobileservice data are both configured in the form of IP datagrams, thedemultiplexer 1303 may use the IP address in order to identify the IPdatagram of the program table information and the mobile service data.

Herein, the identified signaling table information is outputted to theprogram table buffer 1304. And, audio/video/data streams are separatedfrom the IP datagram of mobile service data that are to be selectedamong the IP datagrams of the identified mobile service data, therebybeing respectively outputted to the A/V decoder 1309 and/or the datahandler 1307.

According to an embodiment of the present invention, when thestuff_indicator field within the header of the mobile service datapacket indicates that stuffing bytes are inserted in the payload of thecorresponding mobile service data packet, the demultiplexer 1303 removesthe stuffing bytes from the payload of the corresponding mobile servicedata packet. Then, the demultiplexer 1303 identifies the program tableinformation and the mobile service data. Thereafter, the demultiplexer1303 identifies A/V/D streams from the identified mobile service data.

The program table buffer 1304 temporarily stores the section-typeprogram table information and then outputs the section-type programtable information to the program table decoder 1305.

The program table decoder 1305 identifies tables using a table_id and asection_length in the program table information and parses sections ofthe identified tables and produces and stores a database of the parsedresults in the program table storage unit 1306. For example, the programtable decoder 1305 collects sections having the same table identifier(table_id) to construct a table. The program table decoder 1305 thenparses the table and produces and stores a database of the parsedresults in the program table storage unit 1306.

The A/V decoder 1309 decodes the audio and video streams outputted fromthe demultiplexer 1303 using audio and video decoding algorithms,respectively. The decoded audio and video data is outputted to the A/Vpost-processor 1310.

Here, at least one of an AC-3 decoding algorithm, an MPEG 2 audiodecoding algorithm, an MPEG 4 audio decoding algorithm, an AAC decodingalgorithm, an AAC+ decoding algorithm, an HE AAC decoding algorithm, anAAC SBR decoding algorithm, an MPEG surround decoding algorithm, and aBSAC decoding algorithm can be used as the audio decoding algorithm andat least one of an MPEG 2 video decoding algorithm, an MPEG 4 videodecoding algorithm, an H.264 decoding algorithm, an SVC decodingalgorithm, and a VC-1 decoding algorithm can be used as the audiodecoding algorithm.

The data handler 1307 processes data stream packets required for databroadcasting among data stream packets separated (or identified) by thedemultiplexer 1303 and provides the processed data stream packets to themiddleware engine 1310 to allow the middleware engine 1310 to bemultiplexed them with A/V data. In an embodiment, the middleware engine1310 is a Java middleware engine.

The application manager 1311 receives a key input from the TV viewer anddisplays a Graphical User Interface (GUI) on the TV screen in responseto a viewer request through a User Interface (UI). The applicationmanager 1311 also writes and reads information regarding overall GUIcontrol of the TV, user requests, and TV system states to and from amemory (for example, NVRAM or flash memory). In addition, theapplication manager 1311 can receive parade-related information (forexample, a parade_id) from the demodulating unit 1302 to control thedemultiplexer 1303 to select an RS frame of a parade including arequired mobile service. The application manager 1311 can also receivean ensemble_id to control the demultiplexer 1303 to select an RS frameof an ensemble including mobile service data to be decoded from theparade. The application manager 1311 also controls the channel manager1312 to perform channel-related operations (for example, channel mapmanagement and program table decoder operations).

The channel manager 1312 manages physical and logical channel maps andcontrols the tuner 1301 and the program table decoder 1305 to respond toa channel-related request of the viewer. The channel manager alsorequests that the program table decoder 1305 parse a channel-relatedtable of a channel to be tuned and receives the parsing results from theprogram table decoder 1305.

FIG. 59 illustrates an example of a demodulating unit in a digitalbroadcast receiving system according to the present invention.

The demodulating unit of FIG. 59 uses known data information, which isinserted in the mobile service data section and, then, transmitted bythe transmitting system, so as to perform carrier synchronizationrecovery, frame synchronization recovery, and channel equalization,thereby enhancing the receiving performance. Also the demodulating unitmay turn the power on only during a slot to which the data group of thedesignated (or desired) parade is assigned, thereby reducing powerconsumption of the receiving system.

Referring to FIG. 59, the demodulating unit includes an operationcontroller 2000, a demodulator 2002, an equalizer 2003, a known sequencedetector 2004, a block decoder 2005, and a RS frame decoder 2006. Thedemodulating unit may further include a main service data processor2008. The main service data processor 2008 may include a datadeinterleaver, a RS decoder, and a data derandomizer. The demodulatingunit may further include a signaling decoder 2013. The receiving systemalso may further include a power controller 5000 for controlling powersupply of the demodulating unit.

More specifically, a frequency of a particular channel tuned by a tunerdown converts to an intermediate frequency (IF) signal. Then, thedown-converted data 2001 outputs the down-converted IF signal to thedemodulator 2002 and the known sequence detector 2004. At this point,the down-converted data 2001 is inputted to the demodulator 2002 and theknown sequence detector 2004 via analog/digital converter ADC (notshown). The ADC converts pass-band analog IF signal into pass-banddigital IF signal.

The demodulator 2002 performs self gain control, carrier recovery, andtiming recovery processes on the inputted pass-band digital IF signal,thereby modifying the IF signal to a base-band signal. Then, thedemodulator 2002 outputs the newly created base-band signal to theequalizer 2003 and the known sequence detector 2004.

The equalizer (or channel synchronizer) 2003 compensates the distortionof the channel included in the demodulated signal and then outputs theerror-compensated signal to the block decoder 2005.

At this point, the known sequence detector 2004 detects the knownsequence position information inserted by the transmitting end from theinput/output data of the demodulator 2002 (i.e., the data prior to thedemodulation process or the data after the demodulation process).Thereafter, the position information along with the symbol sequence ofthe known data, which are generated from the detected position, isoutputted to the operation controller 2000, the demodulator 2002, theequalizer 2003, and the signaling decoder 2013. Also, the known sequencedetector 2004 outputs a set of information to the block decoder 2005.This set of information is used to allow the block decoder 2005 of thereceiving system to identify the mobile service data that are processedwith additional encoding from the transmitting system and the mainservice data that are not processed with additional encoding.

In addition, although the connection status is not shown in FIG. 59, theinformation detected from the known sequence detector 2004 may be usedthroughout the entire receiving system and may also be used in the RSframe decoder 2006.

The data demodulated in the demodulator 2002 or the data equalized inthe channel equalizer 2003 is inputted to the signaling decoder 2013.The known data position information detected in the known sequencedetector 2004 is inputted to the signaling decoder 2013.

The signaling decoder 2013 extracts and decodes signaling information(e.g., TPC information, and FIC information), which inserted andtransmitted by the transmitting end, from the inputted data, the decodedsignaling information provides to blocks requiring the signalinginformation.

More specifically, the signaling decoder 2013 extracts and decodes TPCdata and FIC data, which inserted and transmitted by the transmittingend, from the equalized data, and then the decoded TPC data and FIC dataoutputs to the operation controller 2000, the known sequence detector2004, and the power controller 5000. For example, the TPC data and FICdata is inserted in a signaling information region of each data group,and then is transmitted to a receiving system.

The signaling decoder 2013 performs signaling decoding as an inverseprocess of the signaling encoder 105 in FIG. 39, so as to extract TPCdata and FIC data. For example, the signaling decoder 2013 decodes theinputted data using the PCCC method and derandomizes the decoded data,thereby dividing the derandomized data into TPC data and FIC data. Atthis point, the signaling decoder 2013 performs RS-decoding on thedivided TPC data, so as to correct the errors occurring in the TPC data.Subsequently, the signaling decoder 2013 deinterleaves the divided FICdata and then performs RS-decoding on the deinterleaved FIC data, so asto correct the error occurring in the FIC data. The error-corrected TPCdata are then outputted to the operation controller 2000, the knownsequence detector 2004, and the power controller 5000.

The TPC data may also include a transmission parameter which is insertedinto the payload region of an packet by the service multiplexer, andthen is transmitted to transmitter.

Herein, the TPC data may include RS frame information, SCCC information,M/H frame information, and so on, as shown in FIG. 41. The RS frameinformation may include RS frame mode information and RS code modeinformation. The SCCC information may include SCCC block modeinformation and SCCC outer code mode information. The M/H frameinformation may include M/H frame index information, and the TPC datamay include sub-frame count information, slot count information,parade_id information, SGN information, NoG information, and so on.

At this time, the signaling information area within the data group canbe identified using known data information output from the known datadetector 2004. The signaling information area is located from the firstsegment of data block B4 within the data group to a part of the secondsegment. Namely, in the present invention, 276 (=207+69) bytes of thedata block B4 of each data group are assigned to an area for insertingsignaling information. In other words, the signaling information areaincludes 207 bytes of the first segment of the data block B4 and first69 bytes of the second segment of the data block B4. The first knowndata sequence (i.e., first training sequence) is inserted into the lasttwo segments of the data block B3, and the second known data sequence(i.e., second training sequence) is inserted into the second and thirdsegments of the data block B4. At this time, since the second known datasequence is received subsequently to the signaling information area, thesignaling decoder 2013 can decode the signaling information of thesignaling information area by extracting the same from the data outputfrom the demodulator 2002 or the channel equalizer 2003.

More specifically, in the description of the present invention,according to an embodiment of the present invention, the known sequencedetector 2004 first extracts known data sequences included in regions Aand B within the data group. Herein, the positions of the known datasequences included in regions A and B within the data group areidentical to the positions shown in FIG. 19. The demodulator 2002 andthe equalizer 2003 of the present invention respectively may use theknown data sequences, which are included in regions A and B within thedata group, that are first extracted by the known sequence detector2004, so that the demodulator 2002 and the equalizer 2003 canrespectively perform demodulating and channel-equalizing on the mobiledata included in the data group. Also, according to the embodiment ofthe present invention, the signaling decoder 2013 may use the known datasequences included in regions A and B within the data group so as todecode the signaling information. Herein, the decoded signalinginformation may include TPC data and FIC data. According to theembodiment of the present invention, in case the TPC data and the FICdata indicate information associated to the SFCMM data group, the knownsequence detector 2004 extracts known data sequences included in regionsC and D within the data group. Most particularly, according to theembodiment of the present invention, the protocol version field of theTPC data may be used for indicating the information associated to theSFCMM data group. Herein, the positions of the known data sequencesincluded in regions C and D within the data group are identical to thepositions shown in FIG. 20. In this case, according to the embodiment ofthe present invention, the equalizer 2003 may perform channel-equalizingby using the known data sequences extracted from regions C and D of thedata group.

FIG. 60 illustrates a block view showing the structure of a receivingsystem according to an embodiment of the present invention. Thereceiving system of FIG. 60 includes an antenna 5300, a channelsynchronizer 5301, a channel equalizer 5302, a channel decoder 5303, anRS frame decoder 5304, an M/H TP interface block 5305, a signalingdecoder 5306, an operation controller 5307, an FIC processor 5308, acommon IP protocol stack 5309, an interaction channel unit 5310, an A/Vprocessor 5311, a service signaling channel (SCC) processor 5312, afirst storage unit 5313, a service guide (SG) processor 5314, and asecond storage unit 5315. The receiving system may further include arich media environment (RME) processor 5316, a service protection (SP)processor 5317, and a non-real time (NRT) processor 5318. Also, thereceiving system may further include a main service data processingunit. Herein, the main service data processing unit may include a datadeinterleaver, an RS decoder, and a data derandomizer.

According to an embodiment of the present invention, the first storageunit 5313 corresponds to a service map database (DB), and the secondstorage unit 5315 corresponds to a service guide database (DB).

The channel synchronizer 5301 includes a tuner and a demodulator. Thetuner tunes a frequency of a specific channel through the antenna 5300,so as to down-convert the tuned frequency to an intermediate frequency(IF) signal, thereby outputting the converted IF signal to thedemodulator. Herein, the signal being outputted from the tunercorresponds to a passband digital IF signal.

The demodulator included in the channel synchronizer 5301 uses knowndata sequences included in a data group and transmitted from thetransmitting system, so as to perform carrier wave recovery and timingrecovery, thereby converting the inputted pass band digital signal to abaseband digital signal.

For example, among the known data sequences, the channel equalizer 5302uses a 1st known data sequence, and 3rd to 6th known data sequences tocompensate the distortion in a received signal caused by multi path or aDoppler effect. At this point, the channel equalizer 5302 may enhancethe equalizing performance by being fed-back with the output of thechannel decoder 5303.

The signaling decoder 5306 extracts signaling data (e.g., TPC data andFIC data) from the received signal and decodes the extracted signaldata. The decoded TPC data are outputted to the operation controller5307, and the decoded FIC data are outputted to the FIC processor 5308.According to an embodiment of the present invention, the signalingdecoder 5306 performs signaling decoding as an inverse process of thesignaling encoder, so as to extract the TPC data and the FIC data fromthe received signal. For example, the signaling decoder 5306 performs aparallel concatenated convolution code (PCCC) type regressive turbodecoding process on the data corresponding to the signaling informationregion within the inputted data. Then, the signaling decoder 5306derandomizes the turbo-decoded signaling data, thereby separating theTPC data and the FIC data from the derandomized signaling data.Additionally, the signaling decoder 5306 performs RS-decoding on theseparated TPC data as an inverse process of the transmitting system,thereby outputting the RS-decoded TPC data to the operation controller5307.

Herein, the TPC data may include RS frame information, SCCC information,M/H frame information, and so on. The RS frame information may includeRS frame mode information and RS code mode information. The SCCCinformation may include SCCC block mode information and SCCC outer codemode information. The M/H frame information may include indexinformation. And, the TPC data may include subframe count information,slot count information, parade_id information, SGN information, NOGinformation, and so on.

Thereafter, the signaling decoder 5306 performs deinterleaving on theseparated FIC data in subframe units and performs RS decoding on thedeinterleaved data as an inverse process of the transmitting system,thereby outputting the RS-decoded data to the FIC processor 5308. Thetransmission unit of the FIC data being deinterleaved and RS-decoded bythe signaling decoder 5306 and outputted to the FIC processor 5308corresponds to FIC segments.

The channel decoder 5303, which is also referred to as a block decoder,performs forward error correction in order to recover meaningful data(e.g., mobile service data) from the received signal. According to anembodiment of the present invention, in order to do so, the channeldecoder 5303 uses SCCC-related information (e.g., SCCC blockinformation, SCCC outer code mode information, and so on) included inthe signaling data. According to the embodiment of the presentinvention, if the data being channel-equalized and inputted from thechannel equalizer 5302 correspond to data processed with both serialconcatenated convolution code (SCCC) type block-encoding andtrellis-encoding (i.e., data within the RS frame, signaling data) by thetransmitting system, the channel decoder 5303 performs trellis-decodingand block-decoding on the corresponding data as an inverse process ofthe transmitting system. Alternatively, if the data beingchannel-equalized and inputted from the channel equalizer 5302correspond to data processed only with trellis-encoding and not withblock-encoding (i.e., main service data), the channel decoder 5303performs only trellis-decoding on the corresponding data.

By performing RS-CRC decoding on the received data, the RS frame decoder5304 recovers the RS frame. More specifically, the RS frame decoder 5304performs forward error correction in order to recover the RS frame. Inorder to do so, according to an embodiment of the present invention, theRS frame decoder 5304 uses RS-associated information (e.g., RS codemode) among the signaling data.

The M/H TP interface block 5305 extracts M/H TP packets from the RSframe, so as to recover the IP datagram, thereby outputting therecovered IP datagram to the common IP protocol stack 5309. Herein, theM/H TP packets encapsulate the IP datagram. More specifically, theheader of each M/H TP packet is analyzed so as to recover the IPdatagram from the payload of the corresponding M/H TP packet.

The operation controller 5307 uses the decoded TPC data structure so asto control the operations of various baseband processes. Morespecifically, the operation controller 5307 receives the TPC data anddelivers information, such as M/H frame timing information, informationon whether or not a data group exists in a selected parade, positioninformation of known data within the data group, and power controlinformation, to block requiring the respective information.

The FIC processor 5308 collects (or gathers) FIC segments to recover anFIC chunk and stores the recovered FIC chunk in the first storage unit5313. The FIC chunk includes signaling information required in anensemble selection process and a mobile (or M/H) service scanningprocess.

The service signaling channel processor 5312 extracts service signalingchannel table sections from the designated IP multicast streams andstores the extracted service signaling channel table sections in thefirst storage unit 5313. The service signaling channel includes IP levelsignaling information, which is required for M/H service selection andscanning processes. Herein, the service signaling channel according tothe present invention transmits at least one of an SMT, a GAT, an RRT, aCIT, and an SLT. At this point, according to embodiment of the presentinvention, the access information of the IP datagram transmitting theservice signaling channel corresponds to a well-known destination IPaddress and a well-known destination UDP port number. Therefore, theservice signaling channel processor 5312 has a well-known destination IPaddress and a well-known destination UDP port number, thereby beingcapable of extracting the IP stream transmitting the service signalingchannel, i.e., service signaling data. Then, at least one of the SMT,the GAT, the RRT, the CIT, and the SLT extracted from the servicesignaling data is recovered and stored in the first storage unit 5313.For example, the first storage unit 5313 stores a service map configuredfrom signaling information collected the FIC processor 5308 and theservice signaling channel processor 5312.

The A/V processor 5311 receives the IP datagram from the common IPprotocol stack 5309. Then, the A/V processor 5311 separates the audiodata and the video data from the received IP datagram and decoded eachof the audio data and the video data with a respective decodingalgorithm, thereby displaying the decoded data to the screen. Forexample, at least one of an AC-3 decoding algorithm, an MPEG 2 audiodecoding algorithm, an MPEG 4 audio decoding algorithm, an AAC decodingalgorithm, an AAC+ decoding algorithm, an HE AAC decoding algorithm, anAAC SBR decoding algorithm, an MPEG surround decoding algorithm, and aBSAC decoding algorithm may be applied be used as the audio decodingalgorithm, and at least one of an MPEG 2 video decoding algorithm, anMPEG 4 video decoding algorithm, an H.264 decoding algorithm, an SVCdecoding algorithm, and a VC-1 decoding algorithm may be applied as thevideo decoding algorithm.

The SG processor 5314 recovers announcement data and stores therecovered announcement data to the second storage unit 5315, therebyproviding a service guide to the viewer.

The interaction (or return) channel unit 5310 provides an uplink fromthe receiving system through the common IP protocol stack 5309. At thispoint, the interaction channel should be IP-compatible.

The RME processor 5316 receives an M/H broadcast program or RME datathrough the common IP protocol stack 5309, the RME data being deliveredthrough the interaction channel. Then, the received M/H broadcastprogram or RME data are recovered and then processed.

The SP processor 5317 recovers and processes data associated withservice protection, which are received through the common IP protocolstack 5309. Then, the SP processor 5317 provides protection to the M/Hservice depending upon the subscription state of the viewer (or user).

The NRT processor 5318 recovers and processes non-real time data, suchas file application.

Channel Synchronizer

FIG. 61 illustrates a detailed block view of a demodulator included inthe channel synchronizer 5301 according to an embodiment of the presentinvention.

The channel synchronizer 5301 of FIG. 53 may include a phase splitter1501, a first multiplier 1502, a resampler 1503, a Matched Filter 1504,a Timing Recovery block 1505, a Group Position Synchronization & InitialFrequency offset estimator 1506, a Carrier Recovery block 1507, and a DCremover 1508. According to an embodiment of the present invention, ananalog-to-digital converter (not shown) converting a passband analogsignal to a passband digital signal may be provided at the front end thephase splitter 1501. Also, according to an embodiment of the presentinvention, an automatic gain control (AGC) is performed before carrierrecovery and timing recovery.

The carrier recovery block 1507 includes a delay unit 1601, a secondmultiplier 1603, a carrier frequency offset detector 1604, a multiplexer1605, a loop filter 1606, and Numerically Controlled Oscillator (NCO)1607.

Also referring to FIG. 60, the phase splitter 1501 receives a pass banddigital signal and splits the received signal into a pass band digitalsignal of a real number element and a pass band digital signal of animaginary number element both having a phase of 90 degrees between oneanother. In other words, the pass band digital signal is split intocomplex signals. The split portions of the pass band digital signal arethen outputted to the first multiplier 1502. Herein, the real numbersignal outputted from the phase splitter 1501 will be referred to as an‘I’ signal, and the imaginary number signal outputted from the phasesplitter 1501 will be referred to as a ‘Q’ signal, for simplicity of thedescription of the present invention.

It is assumed that the signal being outputted from the tuner of thepresent invention is an intermediate frequency (IF) of 44 MHz. Accordingto another embodiment of the present invention, the signal beingoutputted from the tuner may also be a zero IF signal (i.e., complexbaseband signal). In this case, the zero IF signal is inputted to thefirst multiplier 1502 bypassing the phase splitter 1501.

The first multiplier 1502 multiplies the I and Q pass band digitalsignals, which are outputted from the phase splitter 1501, by a digitalcomplex signal outputted from the NCO 1607 of the carrier recovery block1507, thereby down-converting the I and Q passband digital signals tobaseband digital complex signals. At this point, by multiplying thecarrier frequency offset being outputted from the carrier recovery block1507 by the output of the phase splitter 1501, the carrier frequencyoffset included in the output signal of the phase splitter 1501 iscompensated. Thereafter, the baseband digital signals of the firstmultiplier 1502 are inputted to the resampler 1503.

The resampler 1503 multiplies the signals outputted from the firstmultiplier 1502 by a sampling clock provided by the timing recoveryblock 1505, so as to compensate symbol timing errors, thereby outputtingthe compensated signals to the matched filter 1504 and the timingrecovery block 1505.

The matched filter 1504 performs matched filtering on the output signalsof the resampler 1503, thereby outputting the signals processed withmatched filtering to the Group Position Synchronization & InitialFrequency offset estimator 1506, the Carrier Recovery block 1507, andthe DC remover 1508.

The Group Position Synchronization & Initial Frequency offset estimator1506 detects the place (or position) of the known data sequences thatare included in the data group and received. Simultaneously, the GroupPosition Synchronization & Initial Frequency offset estimator 1506estimates an initial frequency offset during the known data detectionprocess. In this case, the carrier recovery block 1507 may use the knowndata sequence position information and initial frequency offset value toestimate the carrier frequency offset with more accuracy, therebyperforming compensation. Also, the Group Position Synchronization &Initial Frequency offset estimator 1506 performs group positionsynchronization. More specifically, the Group Position Synchronization &Initial Frequency offset estimator 1506 extracts the starting positionof each data group.

For example, the Group Position Synchronization & Initial Frequencyoffset estimator 1506 detects the position (or place) of the known datasequence included in the data group. Then, the Group PositionSynchronization & Initial Frequency offset estimator 1506 outputs thedetected known sequence position indicating signal to the multiplexer1604 and the channel equalizer 1302 of the carrier recovery block 1507.Furthermore, the Group Position Synchronization & Initial Frequencyoffset estimator 1506 estimates the initial frequency offset by usingthe second known data sequence within the data group, which is thenoutputted to the loop filter 1606 of the carrier recovery block 1507.

The timing recovery block 1505 receives the output of the resampler 1503so as to detect the timing error. Then, the timing recovery block 1505outputs a sampling clock being in proportion with the detected timingerror to the resampler 1503, thereby controlling the sampling of theresampler 1503.

The DC remover 1508 removes a pilot tone signal (i.e., DC signal), whichhas been inserted by the transmitting system, from the matched-filteredsignal outputted from the matched filter 1504. Thereafter, the DCremover 1508 outputs the processed signal to the channel equalizer 1302.

Known data sequence position and initial frequency offset estimation

According to an embodiment of the present invention, among the knowndata sequences included in the data group, a correlation of repeatedknown data patterns of a second known data sequence is used to detectthe position of a known data sequence within the data group and toestimate an initial frequency offset. Particularly, according to anembodiment of the present invention, a partial correlation is used todetect the position of a known data sequence and to estimate an initialfrequency offset.

The initial frequency offset includes a rough frequency offset and afiner frequency offset. More specifically, when acquiring carrierfrequency acquisition, at first a rough frequency offset is used toreduce a frequency pull-in range, and, then, a finer frequency offset isused to reduce the frequency pull-in range once again.

In the present invention, the second known data sequence within the datagroup is configured of a first 528 symbol sequence and a second 528symbol sequence each having the same pattern. More specifically, the 528pattern is repeated after a data segment synchronization signal of 4symbols.

In the description of the present invention, the second known datasequence will be referred to as an acquisition training sequence.

The Group Position Synchronization & Initial Frequency offset estimator(or known sequence detector) 1506 uses the repeated known data patternof the second known data sequence, so as to perform group positionsynchronization and initial frequency offset estimation. For example, acorrelation between the received signal and a second known datasequence, which is pre-known based upon an agreement between thetransmitting system and the receiving system, and by finding a maximumcorrelation value, the group position synchronization may be performed.However, if a frequency offset exists in the received signal, thereliability of a general correlation method, wherein an entire secondknown data sequence is used to obtain one correlation value, may bedegraded. More specifically, as the length of a known data pattern forcorrelation becomes longer, the possibility of the reliability of acorrelation peak value being degraded may increase.

Therefore, according to an embodiment of the present invention, apartial correlation method is used to detect a highly reliablecorrelation peak value, even when a large frequency offset exists. Morespecifically, by using the partial correlation method, noise may bereduced.

AS described above, in the present invention, by obtaining a partialcorrelation by dividing (or segmenting) the second known data sequenceinto two or more parts, a peak value among the correlation value foreach part may be obtained. Then, all of the peak correlation values foreach part are added so as to calculate the average (or mean) value.Accordingly, the noise included in the received signal is cancelled,thereby reducing the noise.

In order to do so, the second known data sequence is segmented (ordivided) into multiple parts, and a correlation between the known datasequence of each part (i.e., reference known data sequence of acorresponding part generated from the receiving system) and thereceiving signal is calculated (or obtained) for each part. Thereafter,the partial correlation values obtained for each part are all added. Atthis point, each of the correlation values obtained for each partcorresponds to a squared value (i.e., a magnitude square) having nophase information.

of FIG. 62 shows an example of each part being configured of N number ofsymbols, when the second known data symbol sequence is divided (orsegmented) into L number of parts. More specifically, in (a) of FIG. 62,L represents a number of parts being segmented from the second knowndata symbol sequence, and N represents the length of each part. Also, *signifies a complex conjugate. In other words, a second known datasequence is divided into L number of parts each having the length of Nsymbols. Thereafter, the correlation with the received signal isobtained for each part.

of FIG. 62 illustrates a conceptual view of a partial correlatoraccording to an embodiment of the present invention. Herein, the partialcorrelator consists of a multiplier 1701 shifting known data sequencesof each corresponding part to the received signal so as to performcomplex conjugate multiplication, a first accumulator 1702 accumulatingthe output of the multiplier 1701 for a period of N symbols, a squarer1703 calculating a squared value of the output of the first accumulator1702, and a second accumulator 1704 accumulating the output of thesquarer 1703 for a predetermined period of time, thereby calculating anaverage (or mean) correlation value.

More specifically, the multiplier 1701 shifts the known data sequence ofa corresponding part in accordance with the received signal so as toperform complex conjugate multiplication, thereby outputting themultiplied values to the first accumulator 1702. The first accumulator1702 accumulates the output of the multiplier 1701 for a period of Nsymbols, thereby outputting the accumulated value to the squarer 1703.The output of the first accumulator 1702 corresponds to correlationvalues each having a phase and size. The squarer 1703 calculates thesquared value of the output of the first accumulator 1702, therebyobtaining the size of the correlation value. The second accumulator 1704accumulates the outputs of the squarer 1703 during L sections. Then, thesecond accumulator 1704 divides the accumulated value by L, so as tooutput the average correlation value of the corresponding part, as shownin Equation 2 below.

$\begin{matrix}{{y\lbrack k\rbrack} = {{1/L}{\sum\limits_{i = 0}^{L}{{z\left\lbrack {k + {Ni}} \right\rbrack}}^{2}}}} & \left\lbrack {{Equation}\mspace{14mu} 2} \right\rbrack\end{matrix}$

More specifically, by finding a maximum correlation value during a datagroup period, the Group Position Synchronization & Initial Frequencyoffset estimator 1506 decides a group synchronization position and aknown data sequence position. Also, by suing the partial correlationmethod, the known sequence detector estimates the initial frequencyoffset.

FIG. 63 illustrates an example of estimating a rough initial frequencyoffset by obtaining partial correlation by dividing (or segmenting) asecond known data sequence into 8 parts. When applying this example toFIG. 55, L is equal to 8, and N is equal to 132 symbols. In case of FIG.56, 8 partial correlators are required to be provided, and 8 peakcorrelation values may be obtained accordingly.

In this case, at a maximum correlation position, the Group PositionSynchronization & Initial Frequency offset estimator 1506 calculates aphase difference between the correlation values of each of thesuccessive parts. Then, the Group Position Synchronization & InitialFrequency offset estimator 1506 uses an adder 1801 to add all of thephase differences for each part, thereby outputting an average phasedifference Δθ. Subsequently, by using the average phase difference Δθand the length (N) of each part, the known sequence detector maycalculate ω0 as shown in Equation 3 below.

$\begin{matrix}{{\omega_{0} = \frac{\Delta\theta}{N}}{{Herein},{\omega_{0} = {2\pi\; f\; 0}}}} & \left\lbrack {{Equation}\mspace{14mu} 3} \right\rbrack\end{matrix}$

f0: Normalized frequency offset

Δθ: Average phase difference)

N: Length of each part

According to an embodiment of the present invention, in Equation 3, N isequal to 132.

At this point, the rough (or coarse) frequency offset f0 obtained fromω0 by applying Equation 3 provides a frequency pull-in range of ±80 kHz.A trade-off exists between the frequency pull-in range and a variance ofan estimated error associated to a length of the part. Morespecifically, if the length of a known data pattern for the correlationis short, the frequency pull-in range increases, and the jitter alsoincreases accordingly. On the other hand, if the length of a known datapattern for the correlation is long, the frequency pull-in rangedecreases, and the jitter also decreases accordingly.

Meanwhile, according to an embodiment of the present invention, a finerfrequency offset is estimated by using repeated patterns of the secondknown data sequence. The second known data sequence is configured of twoparts. More specifically, the second known data sequence is configuredof a part including a first 528 symbol sequence and another partincluding a second 528 symbol sequence. Herein, a data segmentsynchronization signal of 4 symbols exists between the first 528 symbolsequence and the second 528 symbol sequence. This structure allows thefiner frequency offset to be estimated by using a Maximum-likelihoodalgorithm.

FIG. 64 illustrates an example of estimating a finer frequency offset byusing the Maximum-likelihood algorithm according to the presentinvention.

At this point, the received signal r[k] may be indicated as shown inEquation 4 below.r[k]=x[k]e ^(−j2πf) ⁰ ^(T) ^(s) ^(k) +n[k]  [Equation 4]

Herein, x[k]: transmitted signal

f0: frequency offset

Ts: symbol duration

n[k]: noise

In Equation 4, f0 corresponds to the finer frequency offset.

Also, the correlation between the received signals separated by532(=528+4) symbols may be obtained (or calculated) by using Equation 5below.

$\begin{matrix}{{{E\left\{ {{r\lbrack k\rbrack}{r^{*}\left\lbrack {k + 532} \right\rbrack}} \right\}} = {{E\left\{ {\left( {{{x\lbrack k\rbrack}{\mathbb{e}}^{{- {j2\pi}}\; f_{0}T_{s}k}} + {n\lbrack k\rbrack}} \right)\left( {{{x^{*}\left\lbrack {k + 532} \right\rbrack}{\mathbb{e}}^{{j2\pi}\; f_{0}{T_{s}{({k + 532})}}}} + {n^{*}\left\lbrack {k + 532} \right\rbrack}} \right)} \right\}} = {\sigma_{s}^{2}{\mathbb{e}}^{{j2\pi}\; f_{0}{T_{s} \cdot 532}}}}}\mspace{76mu}{{Where},{\sigma_{s}^{2}\text{:}\mspace{14mu} E\left\{ {{x\lbrack k\rbrack}}^{2} \right\}}}} & \left\lbrack {{Equation}\mspace{14mu} 5} \right\rbrack\end{matrix}$

More specifically, the partial correlation of the two parts spaced apartby 532 symbols (i.e., each part having the length of 532 symbols) iscalculated and then the average value is calculated. Thereafter, afterapplying an argument, the finer frequency offset can be obtained. Thefiner frequency offset obtained by applying the Equation 5 provides afrequency pull-in range of ±10 kHz.

In the description of the present invention, the rough frequency offsetand the finer frequency offset will be collectively referred to as aninitial frequency offset. The initial frequency offset is outputted tothe loop filter 1606 of the carrier recovery block 1507.

Meanwhile, according to an embodiment of the present invention, thecarrier recovery block 1507 uses a carrier frequency tracking loop, asshown in FIG. 61.

The carrier recovery block 1507 loads an initial frequency offsetestimated from the Group Position Synchronization & Initial Frequencyoffset estimator 1506. Then, the carrier recovery block 1507 tracks theremaining carrier frequency offset.

More specifically, the carrier recovery block 1507 uses aMaximum-likelihood to calculate the correlation of the receivedsuccessive known data sequences, thereby estimating a carrier frequencyoffset (or error) using the same method that is used for the initialfrequency offset estimation.

In order to do so, the delay unit 1601 of the carrier recovery block1507 receives the data outputted from the matched filter 1504 in symbolunits so as to perform a K symbol delay. Thereafter, the delay unit 1601outputs the delayed data to the second multiplier 1603.

Also, the output data of the matched filter 1504 is conjugated by theconjugator 1602. Then, the conjugated data are inputted to the secondmultiplier 1603.

The second multiplier 1603 calculates the correlation value between theknown data sequence delayed by K symbols by the delay unit 1601 and theknown data sequence conjugated by the conjugator 1602. Thereafter, thesecond multiplier 1603 outputs the calculated correlation value to thecarrier frequency offset detector 1604.

Herein, according to an embodiment of the present invention, K symbolsis equal to 13312 symbols (=832*16 symbols). This is because the firstknown data sequence, and the third to sixth known data sequences areinserted and received at intervals of 16 segments, and also because onesegment is configured of 832 symbols.

According to the embodiment of the present invention, the correlationvalue between the known data sequences spaced apart at an interval of13312 symbols may be calculated by applying Equation 6 shown below.

$\begin{matrix}{{E\left\{ {{r\lbrack k\rbrack}{r^{*}\left\lbrack {k + 13312} \right\rbrack}} \right\}} = {\quad{{{E\left\{ {\left( {{{x\lbrack k\rbrack}{\mathbb{e}}^{{- {j2\pi}}\; f_{0}T_{s}k}} + {n\lbrack k\rbrack}} \right)\left( {{{x^{*}\left\lbrack {k + 13312} \right\rbrack}{\mathbb{e}}^{{j2\pi}\; f_{0}{T_{s}{({k + 13312})}}}} + {n^{*}\left\lbrack {k + 13312} \right\rbrack}} \right)} \right\}} = {\sigma_{s}^{2}{\mathbb{e}}^{{j2\pi}\; f_{0}{T_{s} \cdot 13312}}\mspace{70mu}{Where}}},{\sigma_{s}^{2}\text{:}\mspace{14mu} E\left\{ {{x\lbrack k\rbrack}}^{2} \right\}}}}} & \left\lbrack {{Equation}\mspace{14mu} 6} \right\rbrack\end{matrix}$

Herein, x[k]: transmitted signal

f0: carrier frequency offset

Ts: symbol duration

n[k]: noise

In Equation 6, fo corresponds to a carrier frequency offset fortracking.

The carrier frequency offset detector 1604 extracts a carrier frequencyoffset from the correlation value outputted from the second multiplier1603, as shown in Equation 6. Then, the extracted carrier frequencyoffset is outputted to the multiplexer 1605.

In accordance with the Known Sequence Position Indicating Signal fromthe Group Position Synchronization & Initial Frequency offset estimator1506, the multiplexer 1605 selects an output of the carrier frequencyoffset detector 1604 or ‘0’, which is then outputted as the finalcarrier frequency offset value.

More specifically, by using Known Sequence Position Indicating Signal,the validity of the carrier frequency offset value being outputted fromthe carrier frequency offset detector 1604 can be known. If the carrierfrequency offset value is valid, the multiplexer 1605 selects the outputof the carrier frequency offset detector 1604. And, if the carrierfrequency offset value is not valid, the multiplexer 1605 selects ‘0’.Then, the multiplexer 1605 outputs the selection to the loop filter1606.

The loop filter 1606 adds the output of the multiplexer 1605 to theestimated initial frequency offset, so as to perform basebandpass-filtering. Thereafter, the filtered data are outputted to the NCO1607.

The NCO 1607 generates a complex signal corresponding to a basebandpass-filtered carrier frequency offset, thereby outputting the generatedcomplex signal to the first multiplier 1502.

Meanwhile, according to an embodiment of the present invention, byturning the power on only in particular slots, i.e., slots having thedata groups of a parade allocated thereto, wherein the parade includes amobile service requested to be received, the channel synchronizer 1301may reduce power consumption in the receiving system. For this, thereceiving system may further include a power controller (not shown),which controls the power supply of the demodulator.

Channel Equalizer

The data demodulated by the channel synchronizer 5301 using the knowndata are inputted to the channel equalizer 5302. Also, the demodulateddata may be inputted to the known sequence detector 1506.

At this point, a data group that is inputted for the equalizationprocess may be divided into region A to region D (or region A to regionE), as shown in FIG. 11. More specifically, according to the embodimentof the present invention, region A includes M/H block B4 to M/H blockB7, region B includes M/H block B3 and M/H block B8, region C includesM/H block B2 and M/H block B9, and region D includes M/H block B1 andM/H block B10. In other words, one data group is divided into M/H blocksfrom B1 to B10, each M/H block having the length of 16 segments. Also, along training sequence (i.e., known data sequence) is inserted at thestarting portion of the M/H blocks B4 to B8. Furthermore, two datagroups may be allocated (or assigned) to one VSB field. In this case,field synchronization data are positioned in the 37^(th) segment of oneof the two data groups.

The present invention may use known data, which have position andcontent information based upon an agreement between the transmittingsystem and the receiving system, and/or field synchronization data forthe channel equalization process.

The channel equalizer 5302 may perform channel equalization using aplurality of methods. According to the present invention, the channelequalizer 5302 uses known data and/or field synchronization data, so asto estimate a channel impulse response (CIR), thereby performing channelequalization.

Most particularly, an example of estimating the CIR in accordance witheach region within the data group, which is hierarchically divided andtransmitted from the transmitting system, and applying each CIRdifferently will also be described herein.

At this point, a data group can be assigned and transmitted a maximumthe number of 4 in a VSB frame in the transmitting system. In this case,all data group do not include field synchronization data. In the presentinvention, the data group including the field synchronization dataperforms channel-equalization using the field synchronization data andknown data. And the data group not including the field synchronizationdata performs channel-equalization using the known data.

For example, the data of the M/H block B3 including the fieldsynchronization data performs channel-equalization using the CIRcalculated from the field synchronization data area and the CIRcalculated from the first known data area. Also, the data of the M/Hblocks B1 and B2 performs channel-equalization using the CIR calculatedfrom the field synchronization data area and the CIR calculated from thefirst known data area. Meanwhile, the data of the M/H blocks B1 to B3not including the field synchronization data performschannel-equalization using CIRS calculated from the first known dataarea and the third known data area.

As described above, the present invention uses the CIR estimated fromthe known data region in order to perform channel equalization on datawithin the data group. At this point, each of the estimated CIRs may bedirectly used in accordance with the characteristics of each regionwithin the data group. Alternatively, a plurality of the estimated CIRsmay also be either interpolated or extrapolated so as to create a newCIR, which is then used for the channel equalization process.

Herein, when a value F(Q) of a function F(x) at a particular point Q anda value F(S) of the function F(x) at another particular point S areknown, interpolation refers to estimating a function value of a pointwithin the section between points Q and S. Linear interpolationcorresponds to the simplest form among a wide range of interpolationoperations. FIG. 58 illustrates an example of linear interpolation.

More specifically, in a random function F(x), when given the values F(Q)and F(S) each from points x=Q and x=S, respectively, the approximatevalue {circumflex over (F)}(P) of the F(x) function at point x=P may beestimated by using Equation 7 below. In other words, since the values ofF(Q) and F(S) respective to each point x=Q and x=S are known (or given),a straight line passing through the two points may be calculated so asto obtain the approximate value {circumflex over (F)}(P) of thecorresponding function value at point P. At this point, the straightline passing through points (Q,F(Q)) and (S,F(S)) may be obtained byusing Equation 7 below.

$\begin{matrix}{{\hat{F}(x)} = {{\frac{{F(S)} - {F(Q)}}{S - Q}\left( {x - Q} \right)} + {F(Q)}}} & \left\lbrack {{Equation}\mspace{14mu} 7} \right\rbrack\end{matrix}$

Accordingly, Equation 8 below shows the process of substituting p for xin Equation 7, so as to calculate the approximate value {circumflex over(F)}(P) of the function value at point P.

$\begin{matrix}{{{\hat{F}(P)} = {{\frac{{F(S)} - {F(Q)}}{S - Q}\left( {P - Q} \right)} + {F(Q)}}}{{\hat{F}(P)} = {{\frac{S - P}{S - Q}{F(Q)}} + {\frac{P - Q}{S - Q}{F(S)}}}}} & \left\lbrack {{Equation}\mspace{14mu} 8} \right\rbrack\end{matrix}$

The linear interpolation method of Equation 8 is merely the simplestexample of many other linear interpolation methods. Therefore, since anyother linear interpolation method may be used, the present inventionwill not be limited only to the examples given herein.

Alternatively, when a value F(Q) of a function F(x) at a particularpoint Q and a value F(S) of the function F(x) at another particularpoint S are known (or given), extrapolation refers to estimating afunction value of a point outside of the section between points Q and S.Herein, the simplest form of extrapolation corresponds to linearextrapolation.

FIG. 66 illustrates an example of linear extrapolation. As describedabove, for linear extrapolation as well as linear interpolation, in arandom function F(x), when given the values F(Q) and F(S) each frompoints x=Q and x=S, respectively, the approximate value {circumflex over(F)}(P) of the corresponding function value at point P may be obtainedby calculating a straight line passing through the two points.

Herein, linear extrapolation is the simplest form among a wide range ofextrapolation operations. Similarly, the linear extrapolation describedherein is merely exemplary among a wide range of possible extrapolationmethods. And, therefore, the present invention is not limited only tothe examples set forth herein

FIG. 67 illustrates a block diagram of a channel equalizer according toan embodiment of the present invention.

Referring to FIG. 67, the channel equalizer includes a first frequencydomain converter 4100, a channel estimator 4110, a second frequencydomain converter 4121, a coefficient calculator 4122, a distortioncompensator 4130, and a time domain converter 4140.

Herein, the channel equalizer may further include a remaining carrierphase error remover, a noise canceller (NC), and a decision unit.

The first frequency domain converter 4100 includes an overlap unit 4101overlapping input data, and a Fast Fourier Transform (FFT) unit 4102converting the data output from the overlap unit 4101 to frequencydomain data.

The channel estimator 4110 includes a CIR estimator 4111, a firstcleaner 4112, a multiplexer 4113, a CIR calculator 4114, a secondcleaner 4115 and a zero-padding unit 4116.

Herein, the channel estimator 4110 may further include a phasecompensator compensating a phase of the CIR which estimated in the CIRestimator 4111.

The second frequency domain converter 4121 includes a Fast FourierTransform (FFT) unit converting the CIR output from the channelestimator 4110 to frequency domain CIR.

The time domain converter 4140 includes an IFFT unit 4141 converting thedata having the distortion compensated by the distortion compensator4130 to time domain data, and a save unit 4142 extracting only validdata from the data outputted from the IFFT unit 4141. The output datafrom the save unit 4142 corresponds to the channel-equalized data.

If the remaining carrier phase error remover is connected to an outputterminal of the time domain converter 4140, the remaining carrier phaseerror remover estimates the remaining carrier phase error included inthe channel-equalized data, thereby removing the estimated error.

If the noise remover is connected to an output terminal of the timedomain converter 4140, the noise remover estimates noise included in thechannel-equalized data, thereby removing the estimated noise.

More specifically, the receiving data are overlapped by the overlap unit4101 of the first frequency domain converter 4100 at a pre-determinedoverlapping ratio, which are then outputted to the FFT unit 4102. TheFFT unit 4102 converts the overlapped time domain data to overlappedfrequency domain data through by processing the data with FFT. Then, theconverted data are outputted to the distortion compensator 4130.

The distortion compensator 4130 performs a complex number multiplicationon the overlapped frequency domain data outputted from the FFT unit 4102included in the first frequency domain converter 4100 and theequalization coefficient calculated from the coefficient calculator4122, thereby compensating the channel distortion of the overlapped dataoutputted from the FFT unit 4102. Thereafter, the compensated data areoutputted to the IFFT unit 4141 of the time domain converter 4140. TheIFFT unit 4141 performs IFFT on the overlapped data having the channeldistortion compensated, thereby converting the overlapped data to timedomain data, which are then outputted to the save unit 4142. The saveunit 4142 extracts valid data from the data of the channel-equalized andoverlapped in the time domain, and outputs the extracted valid data.

Meanwhile, the received data are inputted to the overlap unit 4101 ofthe first frequency domain converter 4100 included in the channelequalizer and, at the same time, inputted to the CIR estimator 4111 ofthe channel estimator 4110.

The CIR estimator 4111 uses a training sequence, for example, data beinginputted during the known data section and the known data in order toestimate the CIR. If the data to be channel-equalizing is the datawithin the data group including field synchronization data, the trainingsequence using in the CIR estimator 4111 may become the fieldsynchronization data and known data. Meanwhile, if the data to bechannel-equalizing is the data within the data group not including fieldsynchronization data, the training sequence using in the CIR estimator4111 may become only the known data.

For example, the CIR estimator 4111 uses the data received during aknown data section and reference known data generated from the receivingsystem based upon an agreement between the receiving system and thetransmitting system, so as to estimate a channel impulse response (CIR).In order to do so, the CIR estimator 4111 is provided with a KnownSequence Position Indicating Signal from the Group PositionSynchronization & Initial Frequency offset estimator 1506.

Also, in case of the data group including field synchronization, the CIRestimator 4111 may use the data being received during one fieldsynchronization section and the reference field synchronization data,which generated from the receiving system in accordance with anagreement between the transmitting system and the receiving system, soas to estimate a channel impulse response (CIR_FS). In order to do so,the CIR estimator 4111 may be provided with Field Sync PositionInformation from the Group Position Synchronization & Initial Frequencyoffset estimator 1506. The CIR estimator 4111 may estimate a channelimpulse response (CIR) by using a well-known least square (LS) method.

In the LS method, a cross correlation value p between known data thathave passed through a channel during a known data section and known dataalready known by a receiving end (or receiver) is calculated, and anauto-correlation matrix R of the known data is also calculated.Thereafter, a matrix operation (or calculation) of R⁻¹·p is performed sothat the auto-correlation portion existing in the cross correlationvalue p between the received data and the initial (or original) knowndata can be removed, thereby estimating the CIR of the transmissionchannel.

Also, according to another embodiment of the present invention, the CIRestimator may also perform CIR estimation by using a least mean square(LMS) method. For example, in regions A and B within the data group, theChannel Impulse Response (CIR) is estimated by using the Least Square(LS) method, and, then, channel equalization may be performed.Thereafter, in regions C and D within the data group, the CIR isestimated by using the Least Mean Square (LMS) method, and, then,channel equalization may be performed.

The CIR estimated as described above is outputted to the first cleaner4112 and the multiplexer 4113. The multiplexer 4113 may either selectthe output of the first cleaner 4112 or select the output of the CIRestimator 4111 depending upon whether the CIR operator 4114 performsinterpolation on the estimated CIR, or whether the CIR operator 4114performs extrapolation on the estimated CIR. For example, when the CIRoperator 4114 performs interpolation on the estimated CIR, themultiplexer 4113 selects the output of the CIR estimator 4111. And, whenthe CIR operator 4114 performs extrapolation on the estimated CIR, themultiplexer 4113 selects the output of the first cleaner 4112.

The CIR operator 4114 performs interpolation or extrapolation on theestimated CIR and then outputs the interpolated or extrapolated CIR tothe second cleaner 4115.

More specifically, the CIR estimated from the known data includes achannel element that is to be obtained as well as a jitter elementcaused by noise. Since such jitter element deteriorates the performanceof the equalizer, it preferable that a coefficient calculator 4122removes the jitter element before using the estimated CIR. Therefore,according to the embodiment of the present invention, each of the firstand second cleaners 4113 and 4115 removes a portion of the estimated CIRhaving a power level lower than the predetermined threshold value (i.e.,so that the estimated CIR becomes equal to ‘0’). Herein, this removalprocess will be referred to as a “CIR cleaning” process.

The CIR calculator 4114 performs CIR interpolation by multiplying CIRsestimated from the CIR estimator 4111 by each of coefficients, therebyadding the multiplied values. At this point, some of the noise elementsof the CIR may be added to one another, thereby being cancelled.Therefore, when the CIR calculator 4114 performs CIR interpolation, theoriginal (or initial) CIR having noise elements remaining therein. Inother words, when the CIR calculator 4114 performs CIR interpolation,the estimated CIR bypasses the first cleaner 4113 and is inputted to theCIR calculator 4114. Subsequently, the second cleaner 4115 cleans theCIR interpolated by the CIR interpolator-extrapolator 4114.

Conversely, the CIR calculator 4114 performs CIR extrapolation by usinga difference value between two CIRs, so as to estimate a CIR positionedoutside of the two CIRs. Therefore, in this case, the noise element israther amplified. Accordingly, when the CIR calculator 4114 performs CIRextrapolation, the CIR cleaned by the first cleaner 4113 is used. Morespecifically, when the CIR calculator 4114 performs CIR extrapolation,the extrapolated CIR passes through the second cleaner 4115, therebybeing inputted to the zero-padding unit 4116.

When a second frequency domain converter (or Fast Fourier Transform(FFT2)) 4121 converts the CIR, which has been cleaned and output fromthe second cleaner 4115, to a frequency domain, the length and of theinput CIR and the FFT size may not match (or be identical to oneanother). In other words, the CIR length may be smaller than the FFTsize. In this case, the zero-padding unit 4116 adds a number of zeros‘0’s corresponding to the difference between the FFT size and the CIRlength to the input CIR, thereby outputting the processed CIR to thesecond frequency domain converter (FFT2) 4121. Herein, the zero-paddedCIR may correspond to one of the interpolated CIR, extrapolated CIR, andthe CIR estimated in the known data section.

In this case, the zero-padding unit 4116 adds a number of zeros ‘0’scorresponding to the difference between the FFT size and the CIR lengthto the inputted CIR, thereby outputting the processed CIR to the secondfrequency domain converter (FFT2) 4121. Herein, the zero-padded CIR maycorrespond to one of the interpolated CIR, extrapolated CIR, and the CIRestimated in the known data section.

The second frequency domain converter 4121 outputs the converted CIR tothe coefficient calculator 4122.

The coefficient calculator 4122 uses the frequency domain CIR beingoutputted from the second frequency domain converter 4121 to calculatethe equalization coefficient. Then, the coefficient calculator 4122outputs the calculated coefficient to the distortion compensator 4130.Herein, for example, the coefficient calculator 4122 calculates achannel equalization coefficient of the frequency domain that canprovide minimum mean square error (MMSE) from the CIR of the frequencydomain, which is outputted to the distortion compensator 4130.

The distortion compensator 4130 performs a complex number multiplicationon the overlapped data of the frequency domain being outputted from theFFT unit 4102 of the first frequency domain converter 4100 and theequalization coefficient calculated by the coefficient calculator 4122,thereby compensating the channel distortion of the overlapped data beingoutputted from the FFT unit 4102.

Block Decoder

Meanwhile, if the data being inputted to the block decoder 5303, afterbeing channel-equalized by the equalizer 5302, correspond to the datahaving both block encoding and trellis encoding performed thereon (i.e.,the data within the RS frame, the signaling information data, etc.) bythe transmitting system, trellis decoding and block decoding processesare performed on the inputted data as inverse processes of thetransmitting system. Alternatively, if the data being inputted to theblock decoder correspond to the data having only trellis encodingperformed thereon (i.e., the main service data), and not the blockencoding, only the trellis decoding process is performed on the inputteddata as the inverse process of the transmitting system.

The trellis decoded and block decoded data by the block decoder 5303 arethen outputted to the RS frame decoder 5304. More specifically, theblock decoder 5303 removes the known data, data used for trellisinitialization, and signaling information data, MPEG header, which havebeen inserted in the data group, and the RS parity data, which have beenadded by the RS encoder/non-systematic RS encoder or non-systematic RSencoder of the transmitting system. Then, the block decoder 5303 outputsthe processed data to the RS frame decoder 5304. Herein, the removal ofthe data may be performed before the block decoding process, or may beperformed during or after the block decoding process.

Meanwhile, the data trellis-decoded by the block decoder 5303 areoutputted to the data deinterleaver of the main service data processor.At this point, the data being trellis-decoded by the block decoder 5303and outputted to the data deinterleaver may not only include the mainservice data but may also include the data within the RS frame and thesignaling information. Furthermore, the RS parity data that are added bythe transmitting system after the pre-processor may also be included inthe data being outputted to the data deinterleaver.

According to another embodiment of the present invention, data that arenot processed with block decoding and only processed with trellisencoding by the transmitting system may directly bypass the blockdecoder 5303 so as to be outputted to the data deinterleaver. In thiscase, a trellis decoder should be provided before the datadeinterleaver.

More specifically, if the inputted data correspond to the data havingonly trellis encoding performed thereon and not block encoding, theblock decoder 5303 performs Viterbi (or trellis) decoding on theinputted data so as to output a hard decision value or to perform ahard-decision on a soft decision value, thereby outputting the result.

Meanwhile, if the inputted data correspond to the data having both blockencoding process and trellis encoding process performed thereon, theblock decoder 5303 outputs a soft decision value with respect to theinputted data.

In other words, if the inputted data correspond to data being processedwith block encoding by the block processor and being processed withtrellis encoding by the trellis encoding module, in the transmittingsystem, the block decoder 5303 performs a decoding process and a trellisdecoding process on the inputted data as inverse processes of thetransmitting system. At this point, the RS frame encoder of thepre-processor included in the transmitting system may be viewed as anouter (or external) encoder. And, the trellis encoder may be viewed asan inner (or internal) encoder. When decoding such concatenated codes,in order to allow the block decoder 5303 to maximize its performance ofdecoding externally encoded data, the decoder of the internal codeshould output a soft decision value.

FIG. 68 illustrates SCCC encoding process according to an embodiment ofthe present invention.

The SCCC encoding process is related with Convolutional Encoder 30010,Symbol Interleaver 30020, Symbol to Byte Converter 30030, Data MUX 30040and Trellis Encoding Module 30050.

A SCCC Decoder can decode both the main trellis code and the M/Hconvolutional code, considering that they are effectively concatenatedwith each other at the transmitter through the symbol interleaver 30020and the data mux module 30040 as shown in FIG. 30, the data mux module30040, shown as a single block, actually consists of a number ofprocessors including the Group formatter, the Packet formatter, thePacket mux, the RS encoder, the data interleaver, the byte to symbolconverter and the 12-way symbol demultiplexer in the 12-way trellisencoder.

FIG. 69 illustrates a detailed block view showing a block decoder 5303according to an embodiment of the present invention. The block decoder5303 includes an input buffer 5011, a Trellis Code Modulation (TCM)decoder 5012, a data demultiplexer 5013, a symbol deinterleaver 5014, asymbol decoder 5015, a symbol interleaver 5016, and a data multiplexer5017. The TCM decoder 5012 is referred to as an inner decoder, and thesymbol decoder 5015 is referred to as an outer decoder or a trellisdecoder. The block decoder 5303 according to the embodiment of thepresent invention performs SCCC block decoding in SCCC block units onthe inputted data. In FIG. 62, ‘U’ and ‘C’ marked on the TCM decoder5012 and the symbol decoder 5015 respectively indicate 4 ports of softinput soft output (SISO).

The input buffer 5011 temporarily stores values of mobile service datasymbols (i.e., including RS parity data symbols that were added duringRS frame encoding, and CRC data symbols) being channel-equalized andoutputted from the channel equalizer 5011 in SCCC block units.Thereafter, the input buffer 5011 repeatedly outputs the stored valuesto the TCM decoder 5012.

Also, among the symbol values being outputted from the channel equalizer5302, input symbol values of section do not include any mobile servicedata symbol (i.e., including RS parity data symbols that were addedduring RS frame encoding, and CRC data symbols) values bypass the inputbuffer 5011 without being stored. More specifically, since onlytrellis-decoding is performed on the input symbol value of sections thatare not processed with SCCC block encoding, the input buffer 5011directly outputs such input to the TCM decoder 5012 without performingany temporary storing or repeated outputting processes.

The input buffer 5011 refers to information associated to SCCC beingoutputted from the operation controller 5307 or the signaling decoder5308, e.g., the SCCC block mode and SCCC outer code mode, so as tocontrol the storage and output of the input data.

In correspondence with the 12-way trellis encoder, the TCM decoder 5012includes a 12-way Trellis Coded Modulation (TCM) decoder. Herein, 12-waytrellis-decoding is performed on the input symbol value as an inverseprocess of the 12-way trellis-encoder.

More specifically, the TCM decoder 5012 receives as many output symbolvalues of the input buffer 5011 and soft-decision values being fed-backthrough the data multiplexer 5017 as each SCCC blocks, so as to performTCM decoding on each symbol.

At this point, the soft-decision values that are fed-back are matched tobe in a one-to-one correspondence with a number of symbol positionscorresponding to the number of SCCC blocks being outputted from theinput buffer 5011, so that the matched soft-decision values can beinputted to the TCM decoder 5012 based upon the control of the datamultiplexer 5017. More specifically, the symbol values being outputtedfrom the input buffer 5011 and the turbo-decoded and inputted data arematched to one another in accordance with the same position within therespective SCCC block, thereby being outputted to the TCM decoder 5012.For example, if the turbo-decoded data correspond to the third symbolvalue within the SCCC block, the corresponding turbo-decoded data arematched with the third symbol value within the SCCC block beingoutputted from the input buffer 5011, thereby being outputted to the TCMdecoder 5012.

In order to do so, the data multiplexer 5017 controls the system so thatthe input buffer 5011 can store the corresponding SCCC block data whilethe iterative turbo decoding is being performed. And, by using a delaymethod, the data multiplexer 5017 also controls the system so that thesoft-decision value (e.g., LLR) of the output symbol of the symbolinterleaver 5016 can be matched, so as to be in a one-to-onecorrespondence, with the symbol value of the input buffer 5011corresponding to the same position (or location) within the block of theoutput symbol, thereby being inputted to the TCM decoder of thecorresponding way. At this point, in case of a symbol value that is notblock decoded, since the corresponding symbol value is not turbodecoded, a null bit is inputted in the matched output position (orlocation).

After performing this process for a predetermined number of iteration ofturbo decoding, the data of the next SCCC block is stored in the inputbuffer 5011 and then outputted, so as to repeat the turbo-decodingprocess.

The output of the TCM decoder 5012 signifies the reliability of thesymbols being inputted to the trellis encoder of the transmitting systemwith respect to the transmitted symbols. For example, since the 2-bitinput of the trellis encoding module of the transmitting systemcorresponds to one symbol, a Log Likelihood Ratio (LLR) between thelikelihood (or probability) of one bit being ‘1’ and the likelihood (orprobability) of another bit being ‘0’ may be respectively outputted(bit-unit output) for the upper bit and the lower bit. The LogLikelihood Ratio (LLR) signifies a log value on a ratio between thelikelihood value of the input bit being ‘1’ and the likelihood value ofthe input bit being ‘0’. Alternatively, a log likelihood ratio of thelikelihood value of 2 bits, i.e., one symbol being “00”, “01”, “10”, and“11” may be outputted (symbol-unit output) for all four combinations(00,01,10,11). This eventually corresponds to the soft-decision value ofthe received symbol, which indicates the reliability of the bits thatwere inputted to the trellis encoder. Herein, a Maximum A posterioriProbability (MAP), a Soft-Out Viterbi Algorithm (SOVA) may be used asthe decoding algorithm of each TCM decoder included in the TCM decoder5012.

The data demultiplexer 5013 identifies the soft-decision valuescorresponding mobile service data symbols (i.e., including RS paritydata added when performing RS frame encoding, and CRC data symbols) fromthe output of the TCM decoder 5012 and outputs the identifiedsoft-decision values to the symbol deinterleaver 5014. The datademultiplexer 5013 then performs an inverse process of a reorderingprocess of a mobile service data symbol generated from an intermediatestep, wherein the output symbols output from the block processor of thetransmitting system are input to the trellis encoding module (e.g., whenthe symbols pass through the group formatter, the data deinterleaver,the packet formatter, and the data interleaver). The data demultiplexer5013 then performs reordering of the process order of soft decisionvalues corresponding to the mobile service data symbols and outputs theprocessed mobile service data symbols to the symbol deinterleaver 5014.

This is because a plurality of blocks exists between the block processorand the trellis encoding module, and because, due to these blocks, theorder of the mobile service data symbols being outputted from the blockprocessor and the order of the mobile service data symbols beinginputted to the trellis encoding module are not identical to oneanother. More specifically, the data demultiplexer 5013 reorders (orrearranges) the order of the mobile service data symbols being outputtedfrom the outer TCM decoder 5012, so that the order of the mobile servicedata symbols being inputted to the symbol deinterleaver 5014 matches theorder of the mobile service data symbols outputted from the blockprocessor of the transmitting system. The reordering process may beembodied as one of software, middleware, and hardware.

The symbol deinterleaver 5014 performs symbol deinterleaving on the softdecision values of data symbols being reordered and output from the datademultiplexer 5013 as an inverse process of the symbol interleaverincluded in the transmitting system. The size of the SCCC block used bythe symbol deinterleaver 5014 during the symbol deinterleaving processis identical to the interleaving size (i.e., B) of an actual symbol ofthe symbol interleaver included in the transmitting system. This isbecause turbo decoding is performed between the TCM decoder 5012 and thesymbol decoder 5015.

The input and output of the symbol interleaver 5014 all corresponds tosoft-decision value, and the deinterleaved soft-decision values areoutputted to the symbol decoder 5015.

The symbol decoder 5015 has 4 memory states. If the symbol decoder is ina ½ coding rate mode, the memory states are changed in accordance withan input LLR set respective to a symbol. More specifically, in case ofdata being ½-rate encoded and outputted, the output LLR of the symboldeinterleaver 5014 is directly outputted to the symbol decoder 5015.

However, if the symbol decoder is in a ¼ coding rate mode, i.e., in caseof data being ¼-rate encoded and outputted from the symbol encoder ofthe transmitting system, the memory states are changed in accordancewith 2 input LLR sets respective to 2 successive symbols. Therefore, 2input LLR sets should be merged into one LLR set during the input stageof the symbol decoder 5015. In the present invention, the merged LLR setmay be obtained by adding first input LLRs and second input LLRs. IfLi(x) is defined as an input LLR value having a condition of ‘x’, themerged LLR set may be expressed by using Equation 9 shown below.Li(merged nibble=‘0000’)=Li(first symbol=‘00’)+Li(second symbol=‘00’)Li(merged nibble=‘0001’)=Li(first symbol=‘00’)+Li(second symbol=‘01’)Li(merged nibble=‘0010’)=Li(first symbol=‘00’)+Li(second symbol=‘10’)Li(merged nibble=‘0011’)=Li(first symbol=‘00’)+Li(second symbol=‘11’)Li(merged nibble=‘0100’)=Li(first symbol=‘01’)+Li(second symbol=‘00’)Li(merged LLR=‘1111’)=Li(first symbol=‘11’)+Li(secondsymbol=‘11’)  [Equation 9]

Meanwhile, as the opposite of the input LLR processing, the processingof the LLR that is to be outputted from the symbol decoder 5015 isdivided into 2 symbol LLRs in the ¼-code rate mode, as shown in Equation10 below, thereby being outputted.Lo(first symbol=‘00’)≡Maximum Probability whose LLR is from the sets{Lo(merged nibble=‘00XY’)+Delta}Lo(first symbol=‘01’)≡Maximum Probability whose LLR is from the sets{Lo(merged nibble=‘01XY’)+Delta}Lo(first symbol=‘10’)≡Maximum Probability whose LLR is from the sets{Lo(merged nibble=‘10XY’)+Delta}Lo(first symbol=‘11’)≡Maximum Probability whose LLR is from the sets{Lo(merged nibble=‘00XY’)+Delta}Lo(second symbol=‘00’)≡Maximum Probability whose LLR is from the sets{Lo(merged nibble=‘XY00’)+Delta}Lo(second symbol=‘01’)=Maximum Probability whose LLR is from the sets{Lo(merged nibble=‘XY01’)+Delta}Lo(second symbol=‘10’)≡Maximum Probability whose LLR is from the sets{Lo(merged nibble=‘XY10’)+Delta}Lo(second symbol=‘11’)≡Maximum Probability whose LLR is from the sets{Lo(merged nibble=‘XY00’)+Delta}.  [Equation 10]

Herein, X and Y are the arbitrary selected digits from digit 0 or 1.Also, according to an embodiment of the present invention, a correctionterm ‘Delta’ value is calculated from an IETF RFC 3926 “FLUTE—FileDelivery over Unidirectional Transport”.

The symbol decoder 5015 outputs 2 types of soft decision values. Onetype corresponds to a soft-decision value matched with an output symbolof the symbol decoder (hereinafter referred to as a first soft-decisionvalue). The other type corresponds to a soft-decision value matched withan input symbol of the symbol decoder (hereinafter referred to as asecond soft-decision value). The first soft-decision value represents areliability of the output symbol, i.e., two bits, of the symbol encoder.A Log Likelihood Ratio (LLR) between the likelihood (or probability) ofone bit being ‘1’ and the likelihood (or probability) of another bitbeing ‘0’ may be output (bit-unit output) for the upper bit and thelower bit, which configure a symbol. Alternatively, a log likelihoodratio of the likelihood value of 2 bits, i.e., one symbol being “00”,“01”, “10”, and “11” may be output (symbol-unit output) for allcombinations. The first soft-decision value is fed-back to the TCMdecoder 5012 through the symbol interleaver 5016 and the datamultiplexer 5017. The second soft-decision value represents areliability of the input symbol of the symbol encoder of thetransmitting system. The second soft-decision value is expressed as aLog Likelihood Ratio (LLR) between the likelihood (or probability) ofone bit being ‘1’ and the likelihood (or probability) of another bitbeing ‘0’ and output to the RS frame decoder 1304. A Maximum Aposteriori Probability (MAP) or a Soft-Out Viterbi Algorithm (SOVA) maybe used as the decoding algorithm of the symbol decoder 5015.

At this point, when the first soft-decision value being outputted fromthe symbol decoder 5015 is in a ¼ coding rate mode, the firstsoft-decision value is divided into 2 symbol LLRs, as shown in Equation9, so as to be outputted to the symbol interleaver 5016.

For example, when the input/output unit of the symbol decoder 5015corresponds to symbol units, 16 (2⁴=16) different types of soft-decisionvalues (LLRs) are inputted to the symbol decoder 5015. At this point,the 16 (2⁴=16) different types of soft-decision values (i.e., LLRs)being inputted to the symbol decoder 5015 correspond to results ofadding the respective first input LLR and the respective second inputLLR.

If ¼-rate coding is performed by the symbol encoder, the symbol decoder5015 receives the LLR respective to the 16 different symbols andperforms symbol decoding. Thereafter, the symbol decoder 5015 may outputthe LLR respective to the 16 different symbols as the firstsoft-decision value. Alternatively, the symbol decoder 5015 may receivethe LLR respective to 4 bits and performs symbol decoding. Thereafter,the symbol decoder 5015 may output the LLR respective to the 4 bits asthe first soft-decision value.

And, if ½-rate coding is performed by the symbol encoder, the symboldecoder 5015 receives the LLR respective to the 4 different symbols andperforms symbol decoding. Thereafter, the symbol decoder 5015 may outputthe LLR respective to the 4 different symbols as the first soft-decisionvalue. Alternatively, the symbol decoder 5015 may receive the LLRrespective to 2 bits and performs symbol decoding. Thereafter, thesymbol decoder 5015 may output the LLR respective to the 2 bits as thefirst soft-decision value.

According to an embodiment of the present invention, the symbolinterleaver 5016 performs symbol interleaving on the first soft-decisionvalue being outputted from the symbol decoder 5015, thereby outputtingthe symbol-interleaved first soft-decision value to the data multiplexer5017. Herein, the output of the symbol interleaver 5020 also becomes asoft-decision value. According to another embodiment of the presentinvention, the symbol interleaver 5016 performs symbol interleaving onthe first soft-decision value being outputted from the symbol decoder5015, thereby outputting the symbol-interleaved first soft-decisionvalue to the data multiplexer 5017.

If the SCCC block mode is ‘00’, a data group is configured of 10 SCCCblocks. And, if the SCCC block mode is ‘01’, a data group is configuredof 5 SCCC blocks. At this point, the symbol interleaving pattern of the15 SCCC blocks are different from one another. Therefore, in order tostore all symbol interleaving patterns, a memory having a very largecapacity (e.g., ROM) is required. FIG. 70 illustrates a block viewshowing the structure of a symbol interleaver according to the presentinvention, wherein the symbol interleaver can perform symbolinterleaving without requiring a memory, such as ROM. More specifically,when the SCCC block is inputted, symbol interleaved data may be directlyoutputted without having to use a memory, such as ROM.

The symbol interleaver 5016 of FIG. 70 includes a pattern generator 5110and a pattern output unit 5220. The pattern generator 5110 may include amodulo counter 5111, a multiplexer 5113, an accumulator 5114, amultiplier 5115, and a modulo operator 5116. The pattern output unit5220 may include a data remover 5221 and a buffer 5222. Herein, a modulooperation may be further included between the accumulator 5114 and themultiplier 5115. Also, the multiplier 5115 may be configured of multipleadders (or shifters).

In FIG. 70, B represents a Block length in symbols (e.g., SCCC blocklength) being inputted for symbol interleaving. And, L corresponds to asymbol unit block length actually being interleaved y the symbolinterleaver 5016. At this point, L=2m (wherein m is an integer), whereinL should satisfy the condition of L≧B.

The modulo counter 5111 performs sequential counting starting from 0 toL. The accumulator 5114 receives a count value of the modulo counter5111 starting from 0. The multiplexer 5113 selects a constant whenstarting the symbol interleaving process on an SCCC block. Thereafter,the multiplexer 5113 is fed-back with the output of the accumulator5114, thereby outputting the feedback to the accumulator 5114. In thiscase, an initial offset value of symbol interleaving is equal to 0.

The accumulator 5114 adds the output of the modulo counter 5111 and theoutput of the multiplexer 5113 and, then outputs the added value to themultiplier 5113.

The multiplier 5115 multiplies the output of the accumulator 5114 by aconstant 89, thereby outputting the multiplied result to the modulooperator 5116. The modulo operator 5116 performs a modulo L operation onthe output of the multiplier 5115, thereby outputting the processed datato the pattern output unit 5220. According to an embodiment of thepresent invention, the modulo operator 5116 uses a bitwise mask functionto perform the modulo L operation. For example, when the L value isequal to 210, and when only the lower 10 bits among the output of themultiplier 5115 are outputted from the modulo operator 5116 and inputtedto the pattern output unit 5220, the modulo L operation is performed.

When the output value is equal to or greater than B, the data remover5221 of the pattern output unit 5220 discards the input value andoutputs the processed data to the buffer 5222. According to anembodiment of the present invention, the buffer 5222 is configured tohave a First Input First Output (FIFO) structure. The buffer 5222condenses the remaining values that have not been discarded by the dataremover 5221 and then stores the condensed values, which are thenoutputted in accordance with the stored order. Therefore, the firstoutput B outputted from the buffer 5222 corresponds to the symbolinterleaving pattern P(i). At this point, the index i value of thesymbol interleaving pattern P(i) increases from 0 to B-1. If the modulocounter 5111 continues to be operated, and when the next output B iscollected from the buffer 5222, the symbol interleaving pattern at thispoint becomes the inverse order of the symbol interleaving pattern P(i).More specifically, the index i value of the symbol interleaving patternP(i) decreases from B-1 to 0.

Therefore, when the initial offset is set to an L/2 value and not to‘0’, and when symbol interleaving is started, the first B output becomesan inverse order of the interleaving pattern P(i). In this case, theinitial offset value of symbol interleaving becomes an L/2 value.

If 0 is used as the initial offset value, the Lth value being fed-backfrom the accumulator 5114 becomes (L−1)*L/2, and the modulo L of thefeedback value is L/2.

For example, when the initial offset value is set to 0, the symbolinterleaving pattern P(i) may be obtained. When the initial offset valueis set to an L/2 value, an inverse order of the interleaving patternP(i) (i.e., a symbol deinterleaving pattern P(i)−1) may be obtained fromthe beginning. For example, when the symbol deinterleaver 5014 sets anL/2 value as the initial offset value and the symbol interleaver 5016sets ‘0’ as the initial offset value, only one symbol interleavingpattern P(i) is used to perform both the symbol deinterleaving andsymbol interleaving processes.

Alternatively, when only one initial offset is set, and when the modulooperator 5111 performs a counting process up to 2L, a symbolinterleaving pattern and a symbol deinterleaving pattern may begenerated by using a single initial offset.

FIG. 64 illustrates an example of a symbol interleaving patterngenerated when the offset value is equal to 0 according to the presentinvention. In the example shown in FIG. 64, L is equal to 12000, and theSCCC block length is equal to 16384. Herein, the output pattern in anindex starting from 12000 to 23999 corresponds to an inverse order ofthe output pattern in an index starting from 0 to 11999.

Also, since interleaving and deinterleaving are inverse processes of oneanother, the interleaving pattern P(i) and the deinterleaving patternP(i)—1 are not required to be separately generated by the block decoder5303. More specifically, symbol interleaving and deinterleavingoperations may both be performed by using only the symbol interleavingpattern P(i).

of FIG. 72 shows an exemplary process of performing symbol interleavingby using only the symbol interleaving pattern P(i). And, (b) of FIG. 72shows an exemplary process of performing symbol deinterleaving by usingonly the symbol interleaving pattern P(i).

In (a) of FIG. 72, the symbol interleaving process is as describedbelow.

1a. An interleaving pattern P(i) is generated.

1b. The ith input data symbol is written in location i of the memory.

1c. Starting from location i of the memory, an ith output data symbol isread.

When the processes 1a to 1c are performed from 0 to B-1, the symbolinterleaving process for one SCCC block is completed. Herein, the memorymay correspond to a buffer 5222.

In (b) of FIG. 72, the symbol deinterleaving process is as describedbelow.

2a. An interleaving pattern P(i) is generated.

2b. The ith input data symbol is written in location i of the memory.

2c. Starting from location P(i) of the memory, an ith output data symbolis read.

When the processes 2a to 2c are performed from 0 to B-1, the symboldeinterleaving process for one SCCC block is completed. Herein, thevalue of i ranges from 0 to B-1.

More specifically, in (a) and (b) of FIG. 72, step 1b and step 2c accessthe same address of the memory, and step 1c and step 2b access the sameaddress of the memory.

Therefore, after reading previous data starting from a specific location(or position) of the memory, when current data are written in thecorresponding location (or position), the symbol interleaver 5016 andthe symbol deinterleaver 5014 may use a single permutation memory so asto perform symbol interleaving and symbol deinterleaving. Morespecifically, since an address of the memory can be shared during thesymbol interleaving and symbol deinterleaving processes, the memory sizemay be reduced.

As described above, in the present invention, only one symbolinterleaving pattern is used to perform symbol interleaving and symboldeinterleaving, thereby having the effect of reducing the memory size.

More specifically, the data multiplexer 5017 of the block decoder 5303reorders (or rearranges) the output order of the symbol interleaver 5016in accordance with the processing order of the symbol generated from anintermediate step (e.g., the group data formatter, the packet formatter,the data interleaver). Thereafter, the data multiplexer 5017 outputs theprocessed symbols to the TCM decoder 5012. Herein, the reorderingprocess of the data multiplexer 5017 may be embodied as at least one ofsoftware, middleware, and hardware.

The soft-decision values being outputted from the symbol interleaver5016 are matched to be in a one-to-one correspondence with mobileservice data symbol positions corresponding to the number of SCCC blocksbeing outputted from the input buffer 5011. Then, the matchedsoft-decision values are inputted to the TCM decoder 5012. At thispoint, since a main service data symbol or an RS parity symbol, knowndata symbol, signaling information data, and so on, of the main servicedata do not correspond to mobile service data symbols, the datamultiplexer 5017 inserts null data in the corresponding location (orposition), thereby outputting the processed data to the TCM decoder5012. Also, each time the symbols of the SCCC blocks are turbo-decoded,since there is no value being fed-back from the symbol interleaver 5016at the beginning of the first decoding process, the data multiplexer5017 inserts null data in all symbol positions including a mobileservice data symbol, thereby transmitting the processed data to the TCMdecoder 5012.

The second soft-decision values being outputted from the symbol decoder5015 are inputted to the RS frame decoder 5304. For example, the symboldecoder 5015 does not output any second soft-decision value until turbodecoding is performed for a predetermined number of repetition (oriteration) times (e.g., M number of times). Thereafter, when M number ofturbo-decoding processes on one SCCC block is all performed, the secondsoft-decision value of that specific point is outputted to the RS Framedecoder 5304. More specifically, after performing turbo-decoding for apredetermined number of times, the soft decision value of the symboldecoder 5015 is outputted to the RS frame decoder 5304. And, thus, theblock decoding process on one SCCC block is completed.

In the present invention, this will be referred to as an iterative turbodecoding process for simplicity.

At this point, the number of iterative turbo decoding performed betweenthe TCM decoder 5012 and the symbol decoder 5015 may be defined byconsidering hardware complexity and error correction performance.Accordingly, when the number of iterative turbo decoding increases, theerror correction can be enhanced. However, this case disadvantageous inthat the hardware may also increase.

RS Frame Decoder

FIG. 73 illustrates a structure of an RS frame decoder according to anembodiment of the present invention.

RS frame decoder 5304 includes RS Frame builder 6111, RS-CRC Decoder6112 and M/H TP Interface block 5305.

As shown in FIG. 73, an RS Frame decoder 5304 processes a particular M/Hensemble. Ensemble selected by upper layer request. An RS Frame Builder6111 collects data from the selected Ensemble and builds an RS framecorresponding to the selected Ensemble. An RS-CRC decoder detects andcorrects errors in the completed RS frame. An M/H TP interface block5305 derandomizes the data to undo the effects of the M/H randomizer atthe transmitter, and finally outputs M/H TPs.

A RS Frame Decoder 5304 builds an RS Frame, detects errors on each rowof the RS frame by CRC decoding, corrects errors by erasure RS decodingwith error location information from CRC decoding and SCCC decoding oneach column of the RS frame, and outputs M/H TPs (Transport Packets)with marked error indication fields.

FIG. 74 illustrates, when the RS frame mode value is equal to ‘00’, anexemplary process of grouping several portion being transmitted to aparade, thereby forming an RS frame and an RS frame reliability map.

More specifically, the RS frame decoder 2006 receives and groups aplurality of mobile service data bytes, so as to form an RS frame.According to the present invention, in transmitting system, the mobileservice data correspond to data RS-encoded in RS frame units. At thispoint, the mobile service data may already be error correction encoded(e.g., CRC-encoded). Alternatively, the error correction encodingprocess may be omitted.

It is assumed that, in the transmitting system, an RS frame having thesize of (N+2)×(187+P) bytes is divided into M number of portions, andthat the M number of mobile service data portions are assigned andtransmitted to regions A/B/C/D in M number of data groups, respectively.In this case, in the receiving system, each mobile service data portionis grouped, as shown in FIG. 74( a), thereby forming an RS frame havingthe size of (N+2)×(187+P) bytes. At this point, when stuffing bytes (S)are added to at least one portion included in the corresponding RS frameand then transmitted, the stuffing bytes are removed, therebyconfiguring an RS frame and an RS frame reliability map. For example,when S number of stuffing bytes are added to the corresponding portion,the S number of stuffing bytes are removed, thereby configuring the RSframe and the RS frame reliability map.

Herein, when it is assumed that the block decoder 5303 outputs a softdecision value for the decoding result, the RS frame decoder 5304 maydecide the ‘0’ and ‘1’ of the corresponding bit by using the codes ofthe soft decision value. 8 bits that are each decided as described aboveare grouped to create 1 data byte. If the above-described process isperformed on all soft decision values of several portions (or datagroups) included in a parade, the RS frame having the size of(N+2)×(187+P) bytes may be configured.

Additionally, the present invention uses the soft decision value notonly to configure the RS frame but also to configure a reliability map.

Herein, the reliability map indicates the reliability of thecorresponding data byte, which is configured by grouping 8 bits, the 8bits being decided by the codes of the soft decision value.

For example, when the absolute value of the soft decision value exceedsa pre-determined threshold value, the value of the corresponding bit,which is decided by the code of the corresponding soft decision value,is determined to be reliable. Conversely, when the absolute value of thesoft decision value does not exceed the pre-determined threshold value,the value of the corresponding bit is determined to be unreliable.Thereafter, if even a single bit among the 8 bits, which are decided bythe codes of the soft decision value and group to configure one databyte, is determined to be unreliable, the corresponding data byte ismarked on the reliability map as an unreliable data byte.

Herein, determining the reliability of one data byte is only exemplary.More specifically, when a plurality of data bytes (e.g., at least 4 databytes) are determined to be unreliable, the corresponding data bytes mayalso be marked as unreliable data bytes within the reliability map.Conversely, when all of the data bits within the one data byte aredetermined to be reliable (i.e., when the absolute value of the softdecision values of all 8 bits included in the one data byte exceed thepredetermined threshold value), the corresponding data byte is marked tobe a reliable data byte on the reliability map. Similarly, when aplurality of data bytes (e.g., at least 4 data bytes) are determined tobe reliable, the corresponding data bytes may also be marked as reliabledata bytes within the reliability map. The numbers proposed in theabove-described example are merely exemplary and, therefore, do notlimit the scope or spirit of the present invention.

The process of configuring the RS frame and the process of configuringthe reliability map both using the soft decision value may be performedat the same time. Herein, the reliability information within thereliability map is in a one-to-one correspondence with each byte withinthe RS frame. For example, if a RS frame has the size of (N+2)×(187+P)bytes, the reliability map is also configured to have the size of(N+2)×(187+P) bytes. Subsequently, the RS frame reliability map is usedon the RS frames so as to perform error correction.

FIG. 75 and FIG. 76 illustrate an error correction decoding processaccording to an embodiment of the present invention.

According to an embodiment of the present invention, in case of FIG. 75,a CRC syndrome check process is performed once again on the CRC-RSdecoded RS frame. And, the result of the CRC syndrome check process ismarked in an error_indicator field within each M/H service data packetconfiguring the payload of the RS frame. Thereafter, the marked resultis outputted for A/V decoding. For example, the error_indicator field ofthe M/H service data packet having an error existing therein is markedas ‘1’, and the error_indicator field of the M/H service data packethaving no error existing therein is marked as ‘0’. According to theembodiment of the present invention, if the error_indicator field valueof all M/H service data packets within the RS frame payload is set to‘0’ and transmitted by the transmitting system, then based upon the CRCsyndrome check result, only the error_indicator fields of the M/Hservice data packet rows are marked as ‘1’.

Thus, the probability of malfunctioning in blocks receiving andprocessing M/H service data packets (e.g., M/H TP interface block 5305)in later processes may be reduced. For example, the M/H TP interfaceblock 5305 may discard any M/H service data packet having theerror_indicator field marked as ‘1’ without using the corresponding M/Hservice data packet. Accordingly, since the probability ofmalfunctioning in the M/H TP interface block 5305 can be reduced, theoverall performance of the receiving system may be enhanced.

More specifically, when a (N+2)×(187+P)-byte size RS frame and a(N+2)×(187+P)-bit size RF frame reliability map are configured, as shownin (a) and (a′) of FIG. 75, a CRC syndrome check is performed on the RSframe, so as to check whether or not an error has occurred in each row.Subsequently, the presence or absence of an error is marked on a CRCerror flag corresponding to each row, as shown in (b) of FIG. 75. Atthis point, since the portion of the reliability map corresponding tothe CRC checksum as no applicability, the corresponding portion isremoved (or deleted or discarded), so that only Nx(187+P) number ofreliability information remains, as shown in (b′) of FIG. 75.

As described above, after performing the CRC syndrome check, (187+P,187)-RS decoding is performed on N number of columns. At this point,RS-decoding is performed on only N number of columns excluding the last2 columns from the overall (N+2) number of columns because the last 2columns are configured only of CRC checksum and also because thetransmitting system did not perform RS-encoding on the last 2 columns.

At this point, depending upon the number of errors marked on the CRCerror flag, either an erasure decoding process is performed or a generalRS-decoding process is performed.

For example, when the number of rows including CRC error is less than orequal to a maximum number of errors correctable by RS erasure decoding(according to the embodiment of the present invention, the maximumnumber is ‘48’), (235,187)-RS erasure decoding is performed on the RSframe having (18+P) number of N-byte rows, i.e., the RS frame having 235N-byte rows in a column direction, as shown in (d) of FIG. 75. However,when the number of rows including CRC error is greater than the maximumnumber of errors (i.e., 48 errors) correctable by RS erasure decoding,RS erasure decoding cannot be performed. In this case, error correctionmay be performed through a general RS-decoding process. Herein, thepresent invention may further enhance the error correcting ability byusing the reliability map, which was generated when configuring the RSframe, from a soft decision value.

More specifically, the RS frame decoder compares the absolute value ofthe soft decision value of the block decoder 5303 with thepre-determined threshold value, so as to determine the reliability ofthe bit value decided by the code of the corresponding soft decisionvalue. Also, 8 bits, each being determined by the code of the softdecision value, are grouped to form one data byte.

Accordingly, the reliability information on this one data byte isindicated on the reliability map. Therefore, as shown in FIG. 75( c),even though a particular row is determined to have an error occurringtherein based upon a CRC syndrome checking process on the particularrow, the present invention does not assume that all bytes included inthe row have errors occurring therein. The present invention refers tothe reliability information of the reliability map and sets only thebytes that have been determined to be unreliable as erroneous bytes. Inother words, with disregard to whether or not a CRC error exists withinthe corresponding row, only the bytes that are determined to beunreliable based upon the reliability map are set as erasure points.

According to another method, when it is determined that CRC errors areincluded in the corresponding row, based upon the result of the CRCsyndrome checking result, only the bytes that are determined by thereliability map to be unreliable are set as errors. More specifically,only the bytes corresponding to the row that is determined to haveerrors included therein and being determined to be unreliable based uponthe reliability information, are set as the erasure points.

Thereafter, if the number of error points for each column is smallerthan or equal to the maximum number of errors (i.e., 48 errors) that canbe corrected by the RS erasure decoding process, an RS erasure decodingprocess is performed on the corresponding column. Conversely, if thenumber of error points for each column is greater than the maximumnumber of errors (i.e., 48 errors) that can be corrected by the RSerasure decoding process, a general decoding process is performed on thecorresponding column.

More specifically, if the number of rows having CRC errors includedtherein is greater than the maximum number of errors (i.e., 48 errors)that can be corrected by the RS erasure decoding process, either an RSerasure decoding process or a general RS decoding process is performedon a column that is decided based upon the reliability information ofthe reliability map, in accordance with the number of erasure pointswithin the corresponding column.

For example, it is assumed that the number of rows having CRC errorsincluded therein within the RS frame is greater than 48. And, it is alsoassumed that the number of erasure points decided based upon thereliability information of the reliability map is indicated as 40erasure points in the first column and as 50 erasure points in thesecond column. In this case, a (235,187)-RS erasure decoding process isperformed on the first column. Alternatively, a (235,187)-RS decodingprocess is performed on the second column.

As described above, the present invention may apply the process (d) ofFIG. 75 or the process (d′) of FIG. 75, so as to perform errorcorrection decoding on N number of columns excluding the last 2 columnswithin the RS frame.

After performing error correction decoding on the N number of columns,the number of RS errors is counted as shown in (a) of FIG. 76.

At this point, if an error did not occur in any of the columns, or ifall errors have been corrected in process (d) of FIG. 75 or process (d′)of FIG. 75, i.e., if the number of RS errors is equal to ‘0’, thisindicates that there is no error in the (N+187)-byte RS frame payloadconfiguring the M/H service data packet within the corresponding RSframe. Herein, as shown in (b) of FIG. 76, derandomizing is performed onthe (N+187)-byte RS frame payload as an inverse process of thetransmitting system. Thereafter, when outputting each M/H service datapacket (i.e., M/H TP packet) of the derandomized RS frame payload to theM/H TP interface block 5305, the output is performed by setting thevalue of the error_indicator field within the M/H service data packet to‘0’ (i.e., indicating that there is no error), as shown in (c) of FIG.76. More specifically, the value of the error_indicator field withineach of the M/H service data packets configuring the RS frame payload isequally set to ‘0’.

Meanwhile, even though RS-decoding is performed, errors in N number ofcolumns may all remain without being corrected. In this case, the numberof RS errors is not equal to ‘0’.

In this case, as shown in (d) of FIG. 76, a CRC syndrome check isperformed once again on the RS-decoded RS frame, thereby checking onceagain whether or not an error exists in 187 rows.

The CRC syndrome check is repeated in (d) of FIG. 76 because, althoughRS-decoding has not been performed on the last 2 columns (i.e., CRCchecksum data) of the RS frame, RS-decoding has been performed on the Nnumber of columns including M/H service data packet. Accordingly, theeffects (or influence) of the error corrected by RS-decoding may beverified and reflected (or applied).

More specifically, after performing CRC-RS decoding, when the presentinvention repeats the CRC syndrome check process once again on each row,as shown in (d) of FIG. 76, and derandomizes the RS frame payloadprocessed with CRC syndrome checking, as shown in (e) of FIG. 76, andwhen the present invention outputs the derandomized RS frame payload,the present invention marks the CRC syndrome check result in theerror_indicator field of the M/H service data packet configuring thecorresponding row, as shown in (f) of FIG. 76.

For example, when performing the CRC syndrome check once again, if it isdetermined that there is not CRC error in the RS frame, the value of theerror_indicator field within each M/H service data packet of thederandomized RS frame payload is equally set to ‘0’.

When performing the CRC syndrome check once again, if it is determinedthat a CRC error exists in a specific row of the RS frame, for example,the second and third rows of the RS frame, the values of theerror_indicator field within the second and third M/H service datapackets of the derandomized RS frame payload are marked to be equal to‘1’, and the value of the error_indicator field within the remaining M/Hservice data packets is equally marked to be equal to ‘0’.

The present invention is provided with a number (=M) of RS framedecoders aligned in parallel, wherein the number corresponds to thenumber of parades included in one M/H frame. Herein, the RS framedecoder may be configured by being provided with a multiplexer connectedto the input end of each of the M number of RS frame decoders, so as tomultiplex a plurality of portions, and a demultiplexer connected to theoutput end of each of the M number of RS frame decoders.

Signaling Decoding

The signaling decoder 5306 extracts and decodes signaling information(e.g., TPC and FIC information), which was inserted and transmitted bythe transmitting system, from the received (or inputted) data.Thereafter, the signaling decoder 5306 provides the decoded signalinginformation to the block(s) requiring such information.

More specifically, the signaling decoder 5306 extracts and decodes TPCdata and FIC data, which were inserted and transmitted by thetransmitting system, from the equalized data. Then, the signalingdecoder 5306 outputs the TPC data to the operation controller 5307, andthe signaling decoder 5306 outputs the FIC data to the FIC processor5308. For example, the TPC data and the FIC data are inserted in thesignaling information region of each data group, thereby being received.

At this point, the signaling information area within the data group maybe known by using the known data position information that is outputtedfrom the known sequence detector 1506. The signaling information areacorresponds to the area starting from the first segment to a portion ofthe second segment of M/H block B4 within the data group. Morespecifically, in the present invention, 276(=207+69) bytes of the M/Hblock B4 within each data group are allocated to an area for insertingthe signaling information. In other words, the signaling informationarea is configured of 207 bytes corresponding to the first segment ofM/H block B4 and of the first 69 bytes of the second segment of M/Hblock B4. Additionally, the first known data sequence (i.e., firsttraining sequence) is inserted in the last 2 segments of M/H block B3,and the second known data sequence (i.e., second training sequence) isinserted in the second and third segments of M/H block B4. At thispoint, since the second known data sequence is inserted after thesignaling information area and then received, the signaling decoder 5306may extract and decode signaling information of the signalinginformation area from the data being outputted from the channelsynchronizer 5301 or the channel equalizer 5302.

FIG. 77 illustrates a block view of the signaling decoder 5306 accordingto an embodiment of the present invention. The signaling decoder 5306performs iterative turbo decoding and RS-decoding on the data of thesignaling information region among the equalized data. Thereafter, thetransmission parameter (i.e., TPC data) obtained as a result of theabove-described process is outputted to the operation controller 5307,and the FIC data are outputted to an upper layer.

For this operation, the signaling decoder 5306 may include an iterativeturbo decoder 7111, a derandomizer 7112, a demultiplexer 7113, an RSdecoder 7114, a block deinterleaver 7115, and an RS decoder 7116.

FIG. 78 is a detailed block diagram illustrating the iterative turbodecoder 7111. Referring to FIG. 78, upon receiving the signalinginformation area's data from among the equalized data, a demultiplexer(DeMux) 7200 discriminates symbols corresponding to respective branchesof the signaling encoder of the transmission system, and outputs thediscriminated symbols to buffers 7201 and 7401, respectively.

The buffers 7201 and 7401 store input data corresponding to thesignaling information area, and respectively repeatedly output thestored input data to the demultiplexers 7202 and 7402 during the turbodecoding process.

In accordance with one embodiment of the present invention, it isassumed that output data of the even encoder in the signaling encoder ofthe transmission system is processed to be input to 0^(th), 2^(nd), . .. , 10^(th) trellis encoders (i.e., even number trellis encoders), andoutput data of the odd encoder 575 is processed to be input to 1^(st),3^(rd), . . . , 11^(th) trellis encoders. In this case, thedemultiplexer 7202 outputs output data of the buffer 7201 to a trellisdecoder (i.e., TCM decoder) corresponding to the even number trellisencoder. The demultiplexer 7202 receives data fed back from the blockdeinterleaver 7507, and outputs the feed-back data to the same trellisdecoder (i.e., TCM decoder) corresponding to the even number trellisencoder.

In this case, output data of each trellis decoder (TCM decoder)corresponds to a log likelihood ratio (LLR) value. The LLR value is aresult from taking a logarithm of a soft decision value. Morespecifically, the LLR value corresponds to a log likelihood ratio (LLR)between a likelihood of input bit being equal to ‘1’ and a likelihood ofinput bit being equal to ‘0’. An initial value of the LLR is set tozero. The LLR value is transferred to the even component decodercorresponding to the even component encoder contained in the signalingencoder of the transmission system. Input/output (I/O) data of the evencomponent decoder is such an LLR value as well. In this case, since asingle even number trellis decoder interoperates with a single evencomponent decoder, an even component encoder and an even number trellisencoder are considered as a single encoder (effective componentencoder). Hence, the even number trellis decoder and the even componentdecoder can be merged into a single effective component decoder. In thecase where the two decoders configure a single decoder, decodingperformance will be enhanced although complexity increases due to theincreased number of states.

Output signals of the even component decoders 7300 to 7305 aresequentially transferred to the multiplexer 7306 and are thentransferred to the block interleaver 7307. The block interleaver 7307has the same configuration as a block interleaver used for the signalingencoder of the transmitting side.

The LLR value block-interleaved by the block interleaver 7307 is fedback to the demultiplexer 7402. The demultiplexer 7402 outputs the LLRvalue to a corresponding trellis decoder (i.e., TCM decoder) from amongsix trellis decoders, and at the same time transmits output data of thebuffer 2401 to the trellis decoder. For example, provided that the LLRvalue fed back from the block deinterleaver 7507 is an LLR value of thefirst decoder 7500, the demultiplexer 7402 outputs this feed-back LLRvalue and the output data of the buffer 7401 to the trellis decoder ofthe first decoder 7500.

The above-mentioned rules are equally applied to the demultiplexer 7202.The odd number trellis decoder and the odd component decoder can beoperated in the same manner as in the even number trellis decoder andthe even component decoder. Likewise, the odd number trellis decoder andthe odd component decoder can be implemented as a single effectivecomponent decoder.

Output signals of the odd number decoders 7500 to 7505 are sequentiallytransferred to the multiplexer 7506, and are then forwarded to the blockdeinterleaver 7507. The block deinterleaver 7507 is an inverse processof the block interleaver. Thus, the LLR value block-deinterleaved by theblock deinterleaver 7507 is input to the demultiplexer 7202 toaccomplish the iterative turbo decoding.

After the iterative turbo decoding has been repeatedly performed at apredetermined level, the iterative turbo-decoded result is output to thederandomizer 7112.

At this point, in the above-mentioned iterative turbo decoding process,the even and odd decoders must have trellis diagram information of acorresponding encoder. Each of the encoders shown in FIGS. 79( a) and79(b) has five memories D0 to D4 so as to obtain 32 states (i.e., 2⁵states). However, the number of states acquired when start states of allthe signaling information areas are constant may be limited to thenumber of only some states among a total of 32 states. That is, if it isassumed that a start state of the effective component encoder is limitedto a specific state, the effective component encoder may have a smallernumber of states as compared to 32 states.

For example, all memories of the even/odd component encoders of theiterative turbo encoder (i.e., PCCC encoder) are each set to zero at thebeginning of each signaling information area of a single data group.Because the signaling information area just follows a first known datasequence (i.e., 1^(st) training sequence) and the first known datasequence is designed to allow all memories in each of the twelve trellisencoders to have a state of zero at the end of the first known datasequence. As a result, the respective memories of the effectivecomponent encoder always start from a state ‘00000’. That is, allmemories of the effective component encoder are each set to a state ofzero at the beginning of the signaling information area. In this way,provided that all memories of the effective component encoders in thesignaling information area start from the state ‘00000’, the dataencoding can be achieved using only specific states among 32 statesalthough data of the signaling information area is considered to berandom.

The signaling information area ranges from a first segment of an M/Hblock ‘B4’ of a data group to some parts of a second segment thereof.That is, 276 (=207+69) bytes of the M/H block ‘B4’ of each data groupare assigned to an area for inserting signaling information. In otherwords, the signaling information area is composed of 207 bytescorresponding to a first segment of the M/H block ‘B4’ and first 69bytes of a second segment thereof. In addition, the first known datasequence (i.e., the first training sequence) is inserted into the last 2segments of an M/H block ‘B3’, and a second known data sequence (i.e.,the second training sequence) is inserted into second and third segmentsof an M/H block ‘B4’. In this case, the second known data sequence islocated just behind the signaling information area. Third to sixth knowndata sequences (i.e., third to sixth training sequences) arerespectively inserted into the last 2 segments of the M/H blocks B4, B5,B6, and B7.

FIG. 79( a) illustrates an exemplary case in which a trellis encoder isserially concatenated with the even component encoder.

In fact, although a plurality of blocks are located between the evencomponent encoder and the trellis encoder, the receiving systemconsiders two blocks to be concatenated with each other, so that itdecodes data. In other words, the trellis encoder performs precoding onthe high-order bit ‘X2’ generated from the even component encoder, andoutputs the precoded result as a most significant bit ‘Z2’. In addition,the trellis encoder performs trellis-encoding on the low-order bit ‘X1’,so that it outputs the trellis-encoded result as two output bits Z1 andZ0.

FIG. 79( b) illustrates an exemplary case in which a trellis encoder isserially concatenated with the odd component encoder.

In fact, although a plurality of blocks are located between the evencomponent encoder and the trellis encoder, the receiving systemconsiders two blocks to be concatenated with each other, so that itdecodes data. The trellis encoder performs precoding on the high-orderbit ‘X2’ generated from the odd component encoder, and outputs theprecoded result as a most significant bit ‘Z2’. In addition, the trellisencoder performs trellis-encoding on the low-order bit ‘X1’, so that itoutputs the trellis-encoded result as two output bits Z1 and Z0.

FIG. 80 is a trellis diagram including states capable of being acquiredwhen a start state for the even decoder is set to ‘00000’. FIG. 80 is atrellis diagram including states capable of being acquired when a startstate for the odd decoder is set to ‘00000’

For example, if it is assumed that the even component encoder and thetrellis encoder are regarded as a single encoder (i.e., a singleeffective component encoder) in the same manner as in FIG. 79( a), only16 states from among 32 states are effective as shown in FIG. 80. Foranother example, if it is assumed that the odd component encoder and thetrellis encoder are regarded as a single encoder (i.e., a singleeffective trellis encoder) in the same manner as in FIG. 79( b), only 8states are effective as shown in FIG. 80.

In this way, in the case where the component encoder and the trellisencoder are implemented as a single effective component encoder and thenthe encoding of data is carried out in the single effective componentencoder, the number of states to be selected from among 32 states forthe above-mentioned encoding process is changed according to thecomponent encoder structures. In this case, states to be used for theencoding process are changed according to which one of states is used asa start state.

For example, if it is assumed that the odd component encoder and thetrellis encoder are regarded as a single effective component encoder inthe same manner as in FIG. 79( b), the number of states to be used forthe encoding is 8. In addition, if it is assumed that memories of theeffective component encoder shown in FIG. 79( b) are designed to alwaysstart from the state ‘00000’ in the signaling information area, theabove 8 states become ‘00000’, ‘00111’, ‘01010’, ‘01101’, ‘10001’,‘10110’, ‘11011’, and ‘11100’, respectively.

In this way, since only some states from among a total of states areused when the transmission system encodes data of the signalinginformation area, the iterative turbo decoder 7111 of the signalingdecoder 1306 can perform turbo decoding of data using only the effectivestates, thereby greatly reducing complexity of the turbo decoder.

Meanwhile, the derandomizer 7112 performs derandomizing of the iterativeturbo-decoded data, and outputs the derandomized result thedemultiplexer 7113. The demultiplexer (Demux). 7113 discriminatesbetween TPC data composed of 18 bytes and FIC data composed of 51 byteson the basis of the derandomized data.

Here, the TPC data is output to the RS decoder 7114 corresponding to anRS (18, 10) of a GF 256. The RS decoder 7114 receives a result of harddecision from the iterative turbo decoder 7111 so as to perform generalRS decoding, or the RS decoder 7114 receives the result of soft decisionfrom the iterative turbo decoder 7111 so as to perform RS erasuredecoding. TPC data (i.e., transmission parameter information)error-corrected by the RS decoder 7114 is output to the operationcontroller 5307. In this case, the RS decoder 7114 further transmits thedecision result to the operation controller 5307, so that it preventsthe occurrence of operational failure which may be generated frommisjudgment of the transmission parameter.

Also, since some information of the TPC data is repeatedly transmittedto each group, decoding performance can be improved using such afeature. For example, in case of FEC mode information such as SCCC orRS, since information of next M/H frame is repeatedly transmitted tothree sub frames at the rear of one M/H frame, even though decoding issuccessfully performed once within the three subframes, there is noproblem in receiving the next M/H frame.

The FIC data discriminated by the demultiplexer 7113 is output to a(TnoG×51) block deinterleaver 7115. The block deinterleaver 7115 is aninverse process of the (TnoG×51) block interleaver of the signalingencoder of the transmitting side.

For example, the (TnoG×51) block interleaver of the transmitting side isa variable-length block interleaver, and interleaves FIC data containedin each subframe in units of a (TNoG (columns)×51 (rows)) block. In thiscase, ‘TNoG’ is indicative of a total number of data groups allocated toa subframe contained in a single M/H frame.

The FIC data block-deinterleaved by the block deinterleaver 7115 isinput to the RS decoder 7116 corresponding to the RS (51, 37) of the GF256. In the same manner as in the RS decoder 7114 for TPC data, the RSdecoder 7116 is able to use both the hard decision value and the softdecision value, and FIC data error-corrected by the RS decoder 7116 isoutput to the FIC processor 5308.

Meanwhile, TNoG value required by the block deinterleaver 7115 can beacquired from the TPC data output from the RS decoder 7114. To this end,the block deinterleaver 7115 includes a controller.

However, since TNoG of next M/H frame is transmitted to three subframesat the rear of one M/H frame, information of TNoG of the currentsubframe may not be obtained through TPC data decoding. For example, ifthe broadcast receiver is turned on at the third subframe (sub-frame #2)and starts to perform FIC decoding to obtain channel information, andperforms FIC block deinterleaving using TNoG within the TPC data, thebroadcast receiver cannot decode the FIC data until it reaches the nextM/H frame.

Accordingly, the present invention suggests a method for decoding FICdata by acquiring TNoG even without using RS-decoded TPC data.

FIG. 82 illustrates a detailed embodiment of a process of extractingTNoG in accordance with the present invention.

The process of acquiring TNoG according to the present invention may beperformed by the signaling decoder 5306, or may be performed by theoperation controller 5307. According to one embodiment of the presentinvention, TNoG is acquired by the signaling decoder 5306. Inparticular, according to one embodiment of the present invention, acontroller is provided at the block deinterleaver 7115 within thesignaling decoder 1306, and acquires TNoG. This is only one example, andthe controller may be provided outside the block deinterleaver 7115.

In other words, if a command to start FIC decoding is input, thesignaling decoder 5306 searches start of next subframe. For example, itis supposed that a command to start FIC decoding is input at the middleof the n−1th subframe within one M/H frame as shown in (a) of FIG. 82.In this case, start of the nth subframe is searched.

Namely, if the command to start FIC decoding is input, in order toextract start of the subframe, it is identified whether a data groupexists in a corresponding slot. For example, 16 slots are assigned toone subframe. At this time, since known data exist in the data group, itis identified whether the data group exists in the corresponding slot asshown in (b) of FIG. 82 through correlation between a pre-determinedpattern of known data and received data. As another example, informationas to whether the data group exists in the corresponding slot may beprovided from the operation controller 5307.

At this time, if it is identified whether the data group exists in thecorresponding slot, the signaling decoder 5306 performs turbo decoding,signaling derandomizing, and demultiplexing for data of the signalinginformation area within the data group to split TPC data, and performsRS decoding for the split TPC data. Then, the signaling decoder 5306acquires a slot number from the RS-decoded TPC data as shown in (d) ofFIG. 82.

The slot number becomes 0 at a start slot of each sub frame, and has avalue of 15 at the last slot of the corresponding subframe. Accordingly,start of the subframe can be identified by using the slot number.

In other words, the signaling decoder 1306 repeatedly performs thesignaling decoding process until the slot number having a value of 0 isdetected from the TPC data. If the data group within the subframe isassigned and transmitted as shown in (a) of FIG. 82 and the command tostart FIC decoding is input at the middle of the n−1th subframe, startof the nth subframe is detected through the signaling decoding process.If the start of the subframe is detected, the group counter value isreset to 0.

If start of the nth subframe is detected through the above process, thesignaling decoder 5306 detects a data group from the nth sub frame.

The presence of the data group may be identified using the correlationbetween the known data pattern and the received data, or may be providedfrom the operation controller 5307.

If the data group is detected, the group counter value increases by 1 asshown in (f) of FIG. 82. The turbo decoder 7111 and the derandomizer7112 perform turbo decoding and derandomizing for data of the signalinginformation area within the data group. Subsequently, the demultiplexer7113 performs demultiplexing for the derandomized data to split TPC datafrom FIC data, and the RS decoder 7114 performs RS decoding for thesplit TPC data. The slot number is acquired from the RS-decoded TPCdata. Also, the split FIC data (i.e., 51 bytes) are stored in a buffer(not shown) of the block deinterleaver 7115.

The steps are performed whenever the data group is detected from thesubframe to increase the group counter value by 1, and the buffer of theblock deinterleaver 7115 stores the split FIC data by the demultiplexer7113.

This process is performed until the end of the subframe is detected.According to one embodiment of the present invention, the end of thesubframe is detected using the slot number. According to anotherembodiment of the present invention, the end of the subframe is detectedusing the field synchronizing counter value such as (e) of FIG. 82.

If the end of the subframe is identified, TNoG is calculated using thegroup counter value.

The TNoG value is applied to the FIC data stored in the buffer of theblock deinterleaver 7115 to perform block deinterleaving. The blockdeinterleaved FIC data are input to the RS decoder 7116 and thenRS-decoded by the RS decoder 7116. In case of (g) and (h) of FIG. 82,turbo decoding and derandomizing are performed for the FIC data includedin each data group of the nth sub frame for the nth subframe intervaland then stored in the buffer of the block deinterleaver 7115. The TNoGcalculated is applied to the FIC data of the nth subframe stored in thebuffer of the block deinterleaver 7115 to perform block deinterleaving,RS decoding is performed for the block deinterleaved FIC data.

Meanwhile, the end of the subframe may be detected using either the slotnumber such as (d) of FIG. 82 or the field synchronizing counter valuesuch as (e) of FIG. 82.

In other words, if the slot number acquired from the RS-decoded TPC databecomes 0, it means that a new subframe starts. Accordingly, if the slotnumber becomes 0, it is determined that the previous subframe has ended.In this case, since the group counter value increases by 1, the valueobtained by subtracting 1 from the group counter value becomes the TNoGvalue.

However, next subframe is the first subframe of new M/H frame, and datagroup may not exist in next M/H frame due to PRC. Under thecircumstances, if the end of the subframe is detected using the slotnumber, TNoG cannot be identified until M/H frame where data groupexists is detected, whereby FIC decoding time may be delayed. In thiscase, start of the subframe can be determined using the new slot number,and the number of field synchronization values can be counted toidentify the end of the subframe. This is because that eight fieldsynchronization values in one subframe and field synchronization valuesare transmitted regardless of the presence of the data group. Forexample, if the field synchronization counter value is 8, it isdetermined as the end of the subframe. In this case, the group countervalue becomes the TNoG value. The field synchronization values can alsobe detected through correlation.

As described above, the transmitting system, the receiving system, andthe method of transmitting broadcast signals, the method of receivingbroadcast signals according to the present invention have the followingadvantages.

This invention extends a region for mobile service data in a slot. Thus,the transmitter can transmit more mobile service data.

This invention has an advantage enhancing the reception performance of abroadcast signal at a reception system, and a method for processing abroadcast signal by inserting additional known data in regions C, D andE.

In the present invention, it is possible to signal mapping informationbetween an ensemble and a mobile service using an FIC chunk, to segmentthe FIC chunk into FIC segment units, and to transmit the segmentsthrough an FIC, thereby performing fast service acquisition in areception system.

In the present invention, it is possible to transmit a plurality of FICsegments segmented from an FIC chunk through one subframe or a pluralityof subframes so as to prevent the FIC segments from being wasted if theamount of data of the FIC chunk is less or greater than the amount ofdata of FIC segments transmitted through one subframe.

In the present invention, it is possible to transmit protocol versioninformation of an FIC chunk corresponding to an FIC segment through aheader of the FIC segment so as to accurately restore the FIC chunkusing the FIC segments configured by the protocol version in a receptionsystem even when FIC chunks of different protocol versions coexist inone M/H frame.

In the present invention, it is possible to transmit identificationinformation identifying whether signaling information transmittedthrough a payload of an FIC segment through a header of the FIC segmentis signaling information of a current M/H frame or signaling informationof a next M/H frame so as to accurately restore an FIC chunk using theFIC segments of the M/H frame in a reception system even when an FICchunk for signaling ensemble configuration information of the currentM/H frame and an FIC chunk for signaling ensemble information of thenext M/H frame coexist in one M/H frame.

In the present invention, it is possible to secure robust resilience toerrors encountered when mobile service data is transmitted through achannel, to determine whether or not additional mobile data packets areincluded using signaling information in a receiver, and to securecompatibility if the additional packets are not present.

In the present invention, it is possible to receive mobile service datawithout error even when faced with poor channel quality due to ghostsand noises, by including an additional mobile data block in a datagroup.

It will be apparent to those skilled in the art that variousmodifications and variations can be made in the present inventionwithout departing from the spirit or scope of the inventions. Thus, itis intended that the present invention covers the modifications andvariations of this invention provided they come within the scope of theappended claims and their equivalents.

What is claimed:
 1. A method for transmitting a broadcast signal in atransmitter, the method comprising; encoding mobile data for forwarderror correction (FEC) to build a Reed-Solomon (RS) frame; dividing thebuilt RS frame into RS frame portions; dividing the RS frame portionsinto Serially Concatenated Convolutional Code (SCCC) blocks; mapping theSCCC blocks to data blocks and scalable data blocks, the data blocks andscalable data blocks corresponding to a plurality of data segments,wherein at least one of the SCCC blocks includes one of the data blocksand one of the scalable data blocks; encoding signaling data including aheader and a payload; forming data groups including the data blocks andthe scalable data blocks, wherein specific data blocks of the datablocks in the data groups include signaling data having information fora number of ensembles, the ensembles being a collection of servicestransmitted through the data groups; interleaving data in the datagroups; and transmitting the interleaved data during slots in atransmission frame, wherein the interleaved data includes a plurality ofdata segments, and wherein at least one of the plurality of datasegments includes a part of one of the data blocks and a part of one ofthe scalable data blocks.
 2. The method of claim 1, wherein the payloadincludes information corresponding to a number of ensembles transmittedthrough data groups including the scalable data blocks.
 3. The method ofclaim 1, wherein the signaling data are divided into a pluralitysignaling data segment payloads.
 4. The method of claim 3, wherein oneof the data groups includes a segment header for one of the plurality ofsignaling data segments and the one of the plurality of signaling datasegment payloads.
 5. The method of claim 1, wherein: the RS frameincludes a primary RS frame or a secondary RS frame according to an RSframe mode; and the RS frame mode indicates whether to build the primaryRS frame or to build the primary RS frame and the secondary RS frame. 6.An apparatus for transmitting a broadcast signal, the apparatuscomprising; a first encoder configured to encode mobile data for forwarderror correction (FEC) to build a Reed-Solomon (RS) frame and divide thebuilt RS frame into RS frame portions; a divider configured to dividethe RS frame portions into Serially Concatenated Convolutional Code(SCCC) blocks and map the SCCC blocks to data blocks and scalable datablocks, the data blocks and scalable data blocks corresponding to aplurality of data segments, wherein at least one of the SCCC blocksincludes one of the data blocks and one of the scalable data blocks; asecond encoder configured to encode signaling data including a headerand a payload; a group formatter configured to form data groupsincluding the data blocks and the scalable data blocks, wherein specificdata blocks of the data blocks in the data groups include the signalingdata having information for a number of ensembles, the ensembles being acollection of services transmitted through the data groups; aninterleaver configured to interleave data in the data groups; atransmission unit configured to transmit the interleaved data duringslots in a transmission frame, wherein the interleaved data includes aplurality of data segments, and wherein at least one of the plurality ofdata segments includes a part of one of the data blocks and a part ofone of the scalable data blocks.
 7. The apparatus of claim 6, whereinthe payload includes information corresponding to a number of ensemblestransmitted through data groups including the scalable data blocks. 8.The apparatus of claim 6, wherein the signaling data are divided into aplurality of signaling data segment payloads.
 9. The apparatus of claim8, wherein one of the data groups includes a header for one of theplurality of signaling data segments and one of the plurality ofsignaling data segment payloads.
 10. The apparatus of claim 6, wherein:the RS frame includes a primary RS frame or a secondary RS frameaccording to an RS frame mode; and the RS frame mode indicates whetherto build the primary RS frame or to build the primary RS frame and thesecondary RS frame.
 11. A method for receiving a broadcast signal in areceiver, the method comprising; receiving the broadcast signalincluding a transmission frame, wherein a parade of data groups in thebroadcast signal is received during slots within the transmission frame,each of the parade of data groups including data blocks and scalabledata blocks, the data blocks and scalable data blocks corresponding to aplurality of data segments; demodulating the broadcast signal andobtaining signaling data segments in each of the parade of data groups;and decoding signaling data in the signaling data segments, wherein atleast one of the plurality of data segments includes a part of one ofthe data blocks and a part of one of the scalable data blocks, whereinspecific data blocks of the data blocks in the parade of data groupsinclude the signaling data having information for a number of ensembles,the ensembles being a collection of services transmitted through theparade of data groups, and wherein each of the parade of data groupsincludes the signaling data segments having a segment payload.
 12. Themethod of claim 11, wherein the signaling data includes a payload thatincludes information corresponding to a number of ensembles transmittedthrough each of the parade of data groups that include the scalable datablocks.
 13. The method of claim 12, further comprising skipping theinformation corresponding to a number of ensembles transmitted througheach of the parade of data groups that include the scalable data blockswhen each of the parade of data groups includes only the data blocks.14. An apparatus for receiving a broadcast signal, the apparatuscomprising; a receiver configured to receive the broadcast signalincluding a transmission frame, wherein a parade of data groups in thebroadcast signal is received during slots within the transmission frame,each of the parade of data groups including data blocks and scalabledata blocks, the data blocks and scalable data blocks corresponding to aplurality of data segments; a demodulator configured to demodulate thebroadcast signal and obtain signaling data segments in each of theparade of data groups; and a decoder configured to decode signaling datain the signaling data segments, wherein at least one of the plurality ofdata segments includes a part of one of the data blocks and a part ofone of the scalable data blocks, wherein specific data blocks of thedata blocks in the parade of data groups include the signaling datahaving information for a number of ensembles, the ensembles being acollection of services transmitted through the parade of data groups,and wherein each of the parade of data groups includes the signalingdata segments, each of the signaling data segments including a segmentpayload.
 15. The apparatus of claim 14, wherein the signaling dataincludes a payload that includes information corresponding to a numberof ensembles transmitted through each of the parade of data groups thatinclude the scalable data blocks.
 16. The apparatus of claim 15, whereinreceiver is further configured to skip the information corresponding toa number of ensembles transmitted through the each of the parade of datagroups that include the scalable data blocks when each of the parade ofdata groups includes only the data blocks.